leetcode_question_64 Minimum Path Sum
来源:互联网 发布:程序员应届生个人简历 编辑:程序博客网 时间:2024/05/03 23:01
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.
int minPathSum(vector<vector<int> > &grid) { // Start typing your C/C++ solution below // DO NOT write int main() function int row = grid.size(); int col = grid[0].size();int**dp = new int*[row];for(int i=0; i< row; i++)dp[i] = new int[col];dp[0][0] = grid[0][0];for(int j =1; j < col; j++)dp[0][j] = dp[0][j-1] + grid[0][j];for(int i = 1; i < row; i++)for(int j =0; j < col; j++)if(j == 0)dp[i][0] = dp[i-1][0] + grid[i][0];else{int tmp = dp[i-1][j] < dp[i][j-1] ? dp[i-1][j] : dp[i][j-1];dp[i][j] = tmp + grid[i][j];}int tmp = dp[row-1][col-1]; for(int i = 0; i < row; i++)delete[] dp[i];delete[] dp;return tmp; }
- leetcode_question_64 Minimum Path Sum
- 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
- javascript实现省市级联效果
- bt5升级时Setting up w3af (1.2-bt1) ...出现问题的解决方法
- mongoDB——副本集
- java自定义注解
- c++设计模式--建造者模式
- leetcode_question_64 Minimum Path Sum
- linux _c_环境变量
- 参考文献怎么写~(这个老是忘,所以贴在这里)
- 网易游戏面试
- 【黑色蕾丝性感女神XP电脑主题】
- 三路快排 duplicate keys
- 《图解ERP》读书摘要-企业管理难点的总结及根源
- 浅谈 磁盘调度算法(转)
- 2013 ACM/ICPC Asia Regional Chengdu Online 个人总结