【LeetCode】 064. Minimum Path Sum
2017-01-17 05:41
363 查看
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.
public class Solution {
public int minPathSum(int[][] grid) {
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (i != 0 && j != 0) {
grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
} else if (i == 0 && j != 0) {
grid[i][j] += grid[i][j - 1];
} else if (i != 0 && j == 0) {
grid[i][j] += grid[i - 1][j];
}
}
}
return grid[grid.length - 1][grid[0].length - 1];
}
}
Note: You can only move either down or right at any point in time.
public class Solution {
public int minPathSum(int[][] grid) {
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (i != 0 && j != 0) {
grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
} else if (i == 0 && j != 0) {
grid[i][j] += grid[i][j - 1];
} else if (i != 0 && j == 0) {
grid[i][j] += grid[i - 1][j];
}
}
}
return grid[grid.length - 1][grid[0].length - 1];
}
}
相关文章推荐
- LeetCode064 Minimum Path Sum
- 【LeetCode-面试算法经典-Java实现】【064-Minimum Path Sum(最小路径和)】
- leetcode 064 —— Minimum Path Sum
- leetcode解题方案--064--Minimum Path Sum
- LeetCode 064 Minimum Path Sum
- [LeetCode]题解(python):064-Minimum Path Sum
- LeetCode 064 Minimum Path Sum
- leetcode 064. Minimum Path Sum
- Java for LeetCode 064 Minimum Path Sum
- LeetCode 064 Minimum Path Sum
- 【LeetCode-面试算法经典-Java实现】【064-Minimum Path Sum(最小路径和)】
- leetcode_c++:Minimum Path Sum (064)
- Minimum Path Sum -- LeetCode
- leetcode — minimum-path-sum
- LeetCode-64-Minimum Path Sum(动态规划)-Medium
- [leetcode]Minimum Path Sum
- [LeetCode] Minimum Path Sum 解题报告
- 【leetcode】Minimum Path Sum
- Leetcode:Minimum Path Sum
- [LeetCode]Minimum Path Sum