Minimum Path Sum
来源:互联网 发布:小米note网络制式查询 编辑:程序博客网 时间:2024/05/20 11:21
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.
思路:用一个数组存从起点到终点的最短距离。初始化时,全体初始化为最大整数。按行遍历grid,sum就记录从起点到当前行对应sum的列的路径和,每次sum的值取当前值与前一步路径和的较小值+当前格子的值。sum的最后记录的就是从左上起点到右下终点的最短距离。
class Solution {public: int minPathSum(vector<vector<int> > &grid) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. vector<int> sum(grid[0].size()+1, INT_MAX); sum[1] = 0; for(int i=0; i<grid.size(); i++){ for(int j=1; j<=grid[0].size(); j++){ sum[j] = min(sum[j-1], sum[j]) + grid[i][j-1]; } } return sum.back(); }};
- 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
- makefile 中使用函数
- 让我生不如死的Windows CE内存泄漏【转载】
- 根据字段或者注释查询表清单
- Big O, Big Omega, Big Theta的含义
- Ubuntu12.10 64位 + android-ndk-r9 编译ffmpeg遇到的问题
- Minimum Path Sum
- linux文件类型详解
- Android在非UI线程中显示Toast
- C#特性-扩展方法
- Android 各版本历史主要变动(Version1.5-->4.0)全面整理
- 3D技术是亮点 松下PT-HZ900C投影机现身
- ios有哪些优点
- 语法错误 : 缺少“;”(在标识符“ContextRecord”的前面)
- CMPP和SMPP协议比较