int minPathSum(int** grid, int gridSize, int* gridColSize){
int m = gridSize;
int n = *gridColSize;
int dp[m][n];
int i,j;
dp[0][0] = grid[0][0];
for( i = 1; i <n; i++){
dp[0][i] = dp[0][i-1] + grid[0][i];
}
for( i = 1; i <m; i++){
dp[i][0] = dp[i-1][0] + grid[i][0];
}
for( i = 1; i < m; i++){
for( j = 1; j < n; j++){
dp[i][j] = dp[i-1][j] < dp[i][j-1]? dp[i-1][j] + grid[i][j]: dp[i][j-1]+grid[i][j];
}
}
return dp[m-1][n-1];
}
leetcode——64. 最小路径和
最新推荐文章于 2022-03-19 19:35:50 发布