LeetCode 63 Minimum Path Sum
2014-09-01 21:18
253 查看
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.
思路 :求grid[0][0]到grid[i][j]的最小和,就必须得出以下公式
![](http://img.blog.csdn.net/20140901211501828?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvbWx3ZWl4aWFv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
Note: You can only move either down or right at any point in time.
思路 :求grid[0][0]到grid[i][j]的最小和,就必须得出以下公式
public class Solution { public int minPathSum(int[][] grid) { int i,j,min; for(i=1;i<grid.length;i++){ grid[i][0]+=grid[i-1][0]; } for(i=1;i<grid[0].length;i++){ grid[0][i]+=grid[0][i-1]; } for(i=1;i<grid.length;i++){ for(j=1;j<grid[0].length;j++){ min=grid[i-1][j]<grid[i][j-1]?grid[i-1][j]:grid[i][j-1]; grid[i][j]+=min; } } return grid[grid.length-1][grid[0].length-1]; } }
相关文章推荐
- LeetCode - 62/63/64 - Unique Paths/Minimum Path Sum
- LeetCode 64 - Minimum Path Sum
- LeetCode | Minimum Path Sum(最小路径和)
- [Leetcode] Minimum Path Sum (Java)
- LeetCode: Minimum Path Sum
- [Leetcode]-Minimum Path Sum
- leetcode——64——Minimum Path Sum
- LeetCode---Minimum Path Sum
- LeetCode Minimum Path Sum
- 【Leetcode】Minimum sum path
- [leetcode] Minimum Path Sum
- [leetcode 64] Minimum Path Sum------从左上角到右下角的最小路径值
- [LeetCode] Minimum Path Sum
- [LeetCode] Minimum Path Sum in Matrix
- LeetCode 64: Minimum Path Sum
- (LeetCode 64)Minimum Path Sum
- [leetcode]Minimum Path Sum
- LeetCode_64---Minimum Path Sum
- [leetcode]Minimum Path Sum
- [LeetCode] Minimum Path Sum