Leetcode: Minimum Path Sum

class Solution
{
public:
    int minPathSum(vector<vector<int> > &grid)
    {
        if (grid.empty() || grid[0].empty()) return 0;

        int rows = int(grid.size());
        int columns = int(grid[0].size());

        //二维数组的动态申请
        int **result = new int*[rows];
        for (int i = 0; i < rows; ++i)
        {
            result[i] = new int[columns];
        }
        result[0][0] = grid[0][0];

        //第一列进行初始化
        for (int i = 1; i < rows; ++i)
        {
            result[i][0] = result[i - 1][0] + grid[i][0];
        }

        //第一行进行初始化
        for (int i = 1; i < columns; ++i)
        {
            result[0][i] = result[0][i - 1] + grid[0][i];
        }

        //利用递推公式进行计算
        for (int i = 1; i < rows; ++i)
        {
            for (int j = 1; j < columns; ++j)
            {
                result[i][j] = min(result[i - 1][j], result[i][j - 1]) + grid[i][j];
            }
        }

        int sum = result[rows - 1][columns - 1];
        //申请空间的释放
        for (int i = 0; i < rows; ++i)
        {
            delete[] result[i];
        }
        delete[] result;
        return sum;
    }
};

public class Solution
{
    public int MinPathSum(int[,] grid)
    {
        if (grid.Length == 0) return 0;
        //获得二维数组的行数
        int rows = grid.GetLength(0);
        //获得二维数组的列数
        int columns = grid.GetLength(1);
        int[,] result = new int[rows, columns];
        result[0, 0] = grid[0, 0];
        for (int i = 1; i < rows; ++i)
        {
            result[i, 0] = result[i - 1, 0] + grid[i, 0];
        }
        for (int i = 1; i < columns; ++i)
        {
            result[0, i] = result[0, i - 1] + grid[0, i];
        }
        for (int i = 1; i < rows; i++)
        {
            for (int j = 1; j < columns; j++)
            {
                result[i, j] = Math.Min(result[i - 1, j], result[i, j - 1]) + grid[i, j];
            }
        }
        return result[rows - 1, columns - 1];
    }
}