Problem:
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.
Explanation:
给定一个m*n的数组,要从左上角走到右下角,只能往右或往下走,如何让经过的点的值最小。
My Thinking:
类似机器人问题。
My Solution:
class Solution {
public int minPathSum(int[][] grid) {
int m=grid.length;
int n=grid[0].length;
int dp[]=new int[n];
for(int i=0;i<n;i++){
if(i==0){
dp[i]=grid[0][i];
}else{
dp[i]=grid[0][i]+dp[i-1];
}
}
for(int i=1;i<m;i++){
for(int j=0;j<n;j++){
if(j==0){
dp[j]+=grid[i][j];
}else{
dp[j]=grid[i][j]+Math.min(dp[j],dp[j-1]);
}
}
}
return dp[n-1];
}
}
Optimum Thinking:
Optimum Solution: