leetcode:Minimum Path Sum(路线上元素和的最小值)【面试算法题】
来源:互联网 发布:北京 气象站数据 编辑:程序博客网 时间:2024/06/04 19:38
题目:
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.
题意从左上到右下,所有可能的路径中,求经过的元素和最小值。动态规划基础题了,dp每个状态由左边或者上边的值中,较小的值与当前状态的值相加得到。
注意考虑边界情况就行了。
int dp[1000][1000];class Solution {public: int minPathSum(vector<vector<int> > &grid) { int rows=grid.size(); if(rows==0)return 0; int cols=grid[0].size(); if(cols==0)return 0; memset(dp,0,sizeof(dp)); for(int i=0;i<rows;++i) { for(int j=0;j<cols;++j) { if(i==0&&j==0)dp[0][0]=grid[0][0]; else if(j==0)dp[i][0]=dp[i-1][0]+grid[i][0]; else if(i==0)dp[0][j]=dp[0][j-1]+grid[0][j]; else dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j]; } } return dp[rows-1][cols-1]; }}; // http://blog.csdn.net/havenoidea
- leetcode:Minimum Path Sum(路线上元素和的最小值)【面试算法题】
- 动态规划问题系列---Minimum Path Sum(路线上元素和的最小值)
- 【LeetCode-面试算法经典-Java实现】【064-Minimum Path Sum(最小路径和)】
- LeetCode OJ算法题(六十三):Minimum Path Sum
- Minimum Path Sum 最小值的路径
- leetcode:Path Sum (路径之和) 【面试算法题】
- LeetCode算法题——Minimum Path Sum
- LeetCode: Minimum Path Sum
- LeetCode Minimum Path Sum
- LeetCode : Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode] Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode]Minimum Path Sum
- [leetcode]Minimum Path Sum
- LeetCode-Minimum Path Sum
- [leetcode] Minimum Path Sum
- LeetCode - Minimum Path Sum
- .war
- mfc timecore.cpp 34问题
- OGNL 表达式
- 《数学之美》书摘
- 南阳OJ105
- leetcode:Minimum Path Sum(路线上元素和的最小值)【面试算法题】
- c/c++ 复习基础要点01-const指针、指针函数 函数指针、new/delete与malloc/free区别与联系
- awk之行与列的count & sum命令总汇
- poj 2433 Landscaping 贪心
- VC6操作XLS
- Uninstall GOM Player with WindowsUninstaller.Org Removal Tips
- 【cocos2d-x】公告栏的实现-文字左右移动
- 史上最强最全VC6.0到VS2013全部版本下载地址
- 【cocos2d-x】无限重复动作-新手引导箭头上下移动