//动态规划找最短路径
//先计算dp矩阵边、在计算中间
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int b=grid[0].size();
int c=grid.size();
int dp[c][b];
cout<<c<<b<<endl;
dp[0][0]=grid[0][0];
for(int i=1;i<c;i++){
dp[i][0]=dp[i-1][0]+grid[i][0];
}
for(int j=1;j<b;j++){
dp[0][j]=dp[0][j-1]+grid[0][j];
}
for(int i=1;i<c;i++){
for(int j=1;j<b;j++){
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
}
}
return dp[grid.size()-1][grid[0].size()-1];
}
};