Minimum Path Sum
来源:互联网 发布:敏捷软件开发 pdf 编辑:程序博客网 时间:2024/06/16 03:55
Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right whichminimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
一道简单题,同时也是一道典型的动态规划题:
int minPathSum(vector<vector<int> > &grid) { if(grid.size() ==0) return 0; const int m =grid.size(); const int n =grid[0].size(); int f[m][n]; f[0][0] =grid[0][0]; for(int i=1;i<m;i++) { f[i][0] =f[i-1][0] +grid[i][0]; } for(int j=1;j<n;j++) { f[0][j] =f[0][j-1] +grid[0][j]; } for(int i=1;i<m;i++) for(int j=1;j<n;j++) f[i][j] =min(f[i-1][j],f[i][j-1]) +grid[i][j]; return f[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
- 子曰不在词
- 【android 开发知识积累】——属性(Attribute)资源的使用和自定义View组件
- Failed to load the JNI shared library
- String 类
- DoubleKeyMap_实现
- Minimum Path Sum
- OK6410(s3c6410)存储方式之NAND FLASH
- javascript正则表达式
- Jdon Framework
- POJ 3181 Dollar Dayz 01完全背包问题
- XDOJ1264 - 递推5
- 初识android的广播BroadCast
- Jdon
- 测试用例设计白皮书--测试用例基本概念