【LeetCode】Minimum Path Sum

int minPathSum(vector<vector<int> > &grid){int m = grid.size();int n = grid[0].size();int i, j;vector<vector<int>> result;result[0][0] = grid[0][0];for (i = 1; i < m; i++){result[i][0] = grid[i][0] + result[i - 1][0];}for (j = 1; j < m; j++){result[0][j] = grid[0][j] + result[0][j-1];}for (i = 1; i < m; i++){for (j = 1; j < n; j++){result[i][j] = min(result[i - 1][j], result[i][j - 1]) + grid[i][j];}}return result[m - 1][n - 1];}