Minimum Path Sum
来源:互联网 发布:网络编程socket 编辑:程序博客网 时间:2024/06/05 18:14
public class Solution { public int minPathSum(int[][] grid) { int row = grid.length; int col = grid[0].length; int[][] sum = new int[row][col]; sum[0][0] = grid[0][0]; for (int i = 1; i < row; i++) { sum[i][0] = sum[i - 1][0] + grid[i][0]; } for (int i = 1; i < col; i++) { sum[0][i] = sum[0][i - 1] + grid[0][i]; } for (int i = 1; i < row; i++) { for (int j = 1; j < col; j++) { sum[i][j] = Math.min(sum[i - 1][j], sum[i][j - 1]) + grid[i][j]; } } return sum[row - 1][col - 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
- C++析构函数
- FusionCharts图形+数据报表
- TexturePacker
- Velocity宏定义的坑与解决办法
- 游戏中的脚本语言原理与发展
- Minimum Path Sum
- Tiny Formater
- go语言defer使用 .
- ListView setSelection 无效问题
- http://blog.csdn.net/lenotang/article/details/2823230
- JSON详解
- Leetcode[66]-Plus One
- Tiny之Web工程构建
- 开源框架Tiny之内容组成