LeetCode 064 Minimum Path Sum
2015-11-22 17:22
357 查看
题目描述
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.
分析
LeetCode 063 Unique Paths IILeetCode 062 Unique Paths
代码
[code] public static int minPathSum(int[][] grid) { if (grid == null || grid[0] == null) { return 0; } int m = grid.length; int n = grid[0].length; int[][] dp = new int[m] ; dp[0][0] = grid[0][0]; for (int y = 1; y < n; y++) { dp[0][y] = dp[0][y - 1] + grid[0][y]; } for (int x = 1; x < m; x++) { dp[x][0] = dp[x - 1][0] + grid[x][0]; } for (int y = 1; y < n; y++) { for (int x = 1; x < m; x++) { int min = Math.min(dp[x - 1][y], dp[x][y - 1]); dp[x][y] = min + grid[x][y]; } } return dp[m - 1][n - 1]; }
相关文章推荐
- 规范数据库表字段大小写 小写字段名全部更改为大写
- 20135303魏昊卿家庭作业汇总2.64 2.65 3.57 3.64 4.45
- Linux 内核配置和编译
- learn go passing variable-length arguments
- ajax基础
- 【C语言】【笔试题】模拟实现memcmp
- Javah提示未找到 ..的类文件
- hdu 4786 Fibonacci Tree
- UIBezierPath绘制图形
- [LeetCode]Binary Tree Postorder Traversal
- 前端问题
- 我的程序人生_杂谈 X86,WINDOWS,ARM,ANDROID
- CDN
- intellij 关于国际化文件中文乱码
- 在CentOS 6.6 64bit上安装Python 3.5.0
- 【纸牌屋】第二季3
- 程序员都会的35个jQuery小技巧
- Android中外部,内部文件读写
- 将一个十进制数转化为二进制数
- Python:unorderable types: str() > int()