DP
64. Minimum Path Sum public class Solution { public int MinPathSum(int[][] grid) { int m = grid.Length, n = grid[0].Length; int[,] dp = new int[m, n]; dp[0, 0] = grid[0][0]; for (int i = 1; i < m; i++) { dp[i, 0] = dp[i - 1, 0] + grid[i][0]; } for (int i = 1; i < n; i++) { dp[0, i] = dp[0, i - 1] + grid[0][i]; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { ...