Minimum Path Sum
来源:互联网 发布:如何导入整站数据库 编辑:程序博客网 时间:2024/06/14 06:43
题目描述:
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.
代码如下:public class Solution { public int minPathSum(int[][] grid) {int m = grid.length;int n = grid[0].length;int[][] dp = new int[m][n];dp[0][0] = grid[0][0];for(int j = 1;j<n;j++){dp[0][j] = dp[0][j-1] + grid[0][j];}for(int i = 1;i<m;i++){dp[i][0] = dp[i-1][0] + grid[i][0];}for(int j = 1;j<n;j++){for(int i = 1;i<m;i++){dp[i][j] = Integer.min(dp[i-1][j],dp[i][j-1])+grid[i][j];}}return dp[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 自定义控件(二)
- 【C/C++】深入预处理
- 通过跳绳瘦下来是一种怎么样的体验?
- 自定义属性获取
- Mat
- Minimum Path Sum
- Mac构建Openfire+xmpp IM环境,报错UnsupportedClassVersionError
- servlet中service doGet doPost 的关系
- HDU 2018 母牛的故事(C语言)
- goroutine
- 乐学成语——ListView中ImageButton焦点冲突
- Android实现 界面切换
- OKHttp通信使用(一)
- leetcode 213. House Robber II