Minimum Path Sum
来源:互联网 发布:mac怎么打开exe文件 编辑:程序博客网 时间:2024/06/06 03:07
题目: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[i][j]=min{dp[i-1][j]+dp[i][j-1]}+table[i][j].
当前位置的最小和等于左边和右边位置最小和两者的小者+本方格数值。
代码:
class Solution {public://https://leetcode.com/problems/minimum-path-sum/ int minPathSum(vector<vector<int> >& grid) { int m=grid.size(),n=grid[0].size(); if(m==0||n==0){ return 0; }// int sum[m][n]; for(int j=1;j<n;j++){ grid[0][j]=grid[0][j-1]+grid[0][j]; } for(int i=1;i<m;i++){ grid[i][0]=grid[i-1][0]+grid[i][0]; } for(int i=1;i<m;i++){ for(int j=1;j<n;j++){ grid[i][j]=min(grid[i-1][j],grid[i][j-1])+grid[i][j]; } } return grid[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
- 杭电oj-1040-As Easy As A+B
- JAVA删除某一目录下的所有文件及文件夹(linnux环境)
- leetcode系列(43)strStr(KMP)
- 堆排序
- 学习算法第一篇:排序算法
- Minimum Path Sum
- myeclipse 下创建包提示The folder is already a source folder
- java poi 上传与下载word文件
- Android 通过WebService调用天气预报接口
- EA使用教程
- hdoj Be the Winner 2509 (NIM博弈)
- 如何在HTML中嵌入JavaScript
- linux开发常用命令整理
- 【codevs2488】 绿豆蛙的归宿 DP+拓扑排序