Leetcode64. Minimum Path Sum

题目来源：Leetcode

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.

思路:同nuique path

class Solution {
public int minPathSum(int[][] grid) {

if(grid.length<=0)
return 0;
int row=grid.length;
int col=grid[0].length;
int dp[][]=new int [row][col];
// int sum=0;
dp[0][0]=grid[0][0];
for(int i=1;i<row;i++)//处理第一列
{
dp[i][0]=dp[i-1][0]+grid[i][0];
}
for(int i=1;i<col;i++)//处理第一行
{
dp[0][i]=dp[0][i-1]+grid[0][i];
}
for(int i=1;i<row;i++)
for(int j=1;j<col;j++){
if(dp[i-1][j]>dp[i][j-1])
dp[i][j]=dp[i][j-1]+grid[i][j];
else
dp[i][j]=dp[i-1][j]+grid[i][j];
}
return dp[row-1][col-1];

}
}