Description
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.
Examples
Input:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.
代码
注意一下Math.min()会比自己写min函数要快
class Solution {
public int minPathSum(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
int[][] answer = new int[m][n];
int i, j;
answer[0][0] = grid[0][0];
for(i = 1; i < m; i++)
answer[i][0] = answer[i - 1][0] + grid[i][0];
for(i = 1; i < n; i++)
answer[0][i] = answer[0][i - 1] + grid[0][i];
for(i = 1; i < m; i++){
for(j = 1; j < n; j++){
// int tmp = answer[i - 1][j] > answer[i][j - 1]? answer[i][j - 1]: answer[i - 1][j];
int tmp = Math.min(answer[i - 1][j], answer[i][j - 1]);
answer[i][j] = tmp + grid[i][j];
}
}
return answer[m - 1][n - 1];
}
}