【LeetCode】C# 64、Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

找到m×n矩阵中左上到右下和最小的路线并返回其和。
思路：我的思路是每行依次遍历，只与左和上作比较给出小值。

public class Solution {
    public int MinPathSum(int[,] grid) {
         int m = grid.GetLength(0);
        int n = grid.Length / m;
        int[,] map = new int[m,n];
        map[0, 0] = grid[0,0];
        for (int i = 1; i < m; i++){
            map[i,0] = map[i-1,0]+grid[i,0];
        }
        for (int j = 1; j < n; j++){
            map[0,j] = map[0,j-1] + grid[0,j];
        }
        for (int i = 1; i < m; i++){
            for (int j = 1; j < n; j++){
                map[i, j] = (map[i - 1, j] < map[i, j - 1] ? map[i - 1, j] : map[i, j - 1]) + grid[i, j];
            }
        }
        return map[m - 1,n - 1];
    }
}