Question:
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.
Solution:
动态规划思想,要修改数组,是从左上角遍历的~
public class Solution {
public int minPathSum(int[][] grid) {
int m=grid.length;
int n=grid[0].length;
for(int i=0;i<=m-1;i++)
{
for(int j=0;j<=n-1;j++)
{
if(i==0&&j==0)
grid[i][j]=grid[i][j];
else if(i!=0&&j==0)
grid[i][j]=grid[i][j]+grid[i-1][j];
else if(i==0&&j!=0)
grid[i][j]=grid[i][j]+grid[i][j-1];
else
grid[i][j]=Math.min(grid[i][j]+grid[i-1][j],grid[i][j]+grid[i][j-1]);
}
}
return grid[m-1][n-1];
}
}