class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int m = grid.size();
if (m == 0) return 0;
int n = grid[0].size();
if (n == 0) return 0;
for (int i = 1; i < m; i++)
grid[i][0] += grid[i - 1][0];
for (int j = 1; j < n; j++)
grid[0][j] += grid[0][j - 1];
for (int i = 1; i < m; i++)
for (int j = 1; j < n; j++)
grid[i][j] += min(grid[i - 1][j], grid[i][j - 1]);
return grid[m - 1][n - 1];
}
};
Small Case: 4ms
Large Case: 64ms
Time: O(n)
Space: O(1)