64 Minimum Path Sum
来源:互联网 发布:面纱3.0完美数据 编辑:程序博客网 时间:2024/05/22 15:28
题意:给出一个mxn的非负二维数组,求从左上方到右下方所有路径中最小的和。
分析:动态规划。dp[i][j]+=max(dp[i][j+1j],dp[i+1][j])
代码:
int minPathSum(int **grid, int nRows, int nCols) { for(int i=nRows-2;i>=0;--i){ grid[i][nCols-1]+=grid[i+1][nCols-1]; } for(int i=nCols-2;i>=0;--i){ grid[nRows-1][i]+=grid[nRows-1][i+1]; } for(int i=nRows-2;i>=0;--i){ for(int j=nCols-2;j>=0;--j){ grid[i][j]+=(grid[i][j+1]<grid[i+1][j]?grid[i][j+1]:grid[i+1][j]); } } return grid[0][0];}
0 0
- 64Minimum Path Sum
- 64 Minimum Path Sum
- [64]Minimum Path Sum
- 64-Minimum Path Sum
- LeetCode 64: Minimum Path Sum
- [leetcode 64] Minimum Path Sum
- [LeetCode 64]Minimum Path Sum
- leetcode || 64、Minimum Path Sum
- Minimum Path Sum - LeetCode 64
- Minimum Path Sum leetcode 64
- leetcode-64-Minimum Path Sum
- Leetcode 64(Minimum Path Sum)
- LeetCode(64) Minimum Path Sum
- Leetcode #64 Minimum Path Sum
- leetcode 64: Minimum Path Sum
- Leetcode#64||Minimum Path Sum
- LeetCode 64: Minimum Path Sum
- 【LEETCODE】64-Minimum Path Sum
- 抽象类和接口的区别
- Helloworld
- centos 双网卡配置
- 你才20多岁,为什么总怕来不及
- 【LeetCode从零单刷】Add Digits
- 64 Minimum Path Sum
- stringstream的用法
- sql语句优化小技巧
- linux帮助命令与压缩-3
- centos 局域网通过一台计算机桥接上网
- GridView分页
- HelloWorld
- centos 局域网时间同步(NTP)
- JAVA图片压缩代码实现