Minimum Path Sum
来源:互联网 发布:战争程序员白濑 编辑:程序博客网 时间:2024/06/02 05:49
Minimum Path Sum
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.
解题技巧:
该题的解法类似于Unique Paths、Unique PathsII,采用动态规划的方法,不过,该题求从起点到终点的最短路径长度。
状态转换方程为:step[i][j] = min(step[i-1][j] , step[i][j-1]) + grid[i][j]
代码:
int minPathSum(vector< vector<int> >& grid){ int m = grid.size(), n = grid[0].size(); vector< vector<int> > step(m, vector<int>(n, 0)); for(int i = 0; i < m; i ++) { for(int j = 0 ; j < n; j ++) { if(i == 0 && j == 0) { step[i][j] = grid[i][j]; } else if(i == 0) { step[i][j] = step[i][j-1] + grid[i][j]; } else if(j == 0) { step[i][j] = step[i-1][j] + grid[i][j]; } else { if(step[i-1][j] < step[i][j-1]) step[i][j] = step[i-1][j] + grid[i][j]; else step[i][j] = step[i][j-1] + grid[i][j]; } } } return step[m-1][n-1];}
0 0
- LeetCode: Minimum Path Sum
- LeetCode Minimum Path Sum
- LeetCode : Minimum Path Sum
- [Leetcode] Minimum Path Sum
- Minimum Path Sum
- Minimum Path Sum
- [LeetCode] Minimum Path Sum
- [Leetcode] Minimum Path Sum
- Minimum Path Sum
- [LeetCode]Minimum Path Sum
- Minimum Path Sum
- Minimum Path Sum
- Minimum Path Sum
- Minimum Path Sum
- [leetcode]Minimum Path Sum
- Minimum Path Sum
- LeetCode-Minimum Path Sum
- [leetcode] Minimum Path Sum
- linux命令
- cannot convert parameter 1 from 'int' to 'int []'
- BZOJ 4269 高斯消元求线性基
- Android AA框架
- Spring - 事务
- Minimum Path Sum
- swift 网络请求 Get、Post HttpRequest For Swift language (iOS )
- 深入解读Spring Framework IoC容器(第二弹:依赖注入的方式)
- weka学习比较好的网址
- SSH框架整合
- 两种广播接受方式
- 简单的冒泡排序
- 404. Sum of Left Leaves#2(Done)
- Terrain Splatting