LeetCode 64. Minimum Path Sum
来源:互联网 发布:天天酷跑刷钻软件 编辑:程序博客网 时间:2024/06/13 22:40
64. Minimum Path Sum
Description
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.
Analysis
这道题的意思就是求从左上角到右下角的最小路径和,唯一的约束就是只能向右或者向下走。
所以我们不难得到,到达(i,j)的最小路径和,其实就是到达(i-1,j) 和(i,j-1)中的较小值加上(i,j)的权值而已。
注意,到达第一行或者是第一列的某一个位置的走法都只有一种,所以路径和是从起点沿着第一行或者第一列一直加加到终点。
下面是我的代码。
Code
class Solution {public: int minPathSum(vector<vector<int>>& grid) { if(grid.size() == 0) return 0; int len1 = grid.size(); int len2 = grid[0].size(); int res[len1][len2]; res[0][0] = grid[0][0]; for(int i = 1 ; i < len1 ;++i){ res[i][0] = res[i-1][0] + grid[i][0]; } for(int i = 1 ; i < len2 ;++i){ res[0][i] = res[0][i-1] + grid[0][i]; } for(int i = 1 ; i < len1 ;++i) { for(int j = 1; j <len2;++j){ res[i][j] = min(res[i-1][j]+grid[i][j],res[i][j-1]+grid[i][j]); } } return res[len1-1][len2 - 1]; }};
0 0
- [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
- 64. Minimum Path Sum LeetCode
- [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
- LeetCode-64.Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- 搬运自己的html学习笔记1-常用信息展示
- QTreeWidget Qt最常用最好用的树状列表窗体
- 排序算法之快速排序
- Git的使用
- more effective c++——Item M29 引用计数(一)简略的rfstring类设计和写时拷贝
- LeetCode 64. Minimum Path Sum
- JDBC(小结)
- AndroidStudio升级2.3.1gradle无法升级导致build卡主问题解决
- 条件独立的理解及举例
- <<Effective C++>>读书笔记(2)
- php中错误处理
- 传输层-UDP协议详解
- [常用第三方库]RapidJSON
- 弱校联盟con#7 失恋得小T(后缀数组)