64. Minimum Path Sum
来源:互联网 发布:淘宝动态评分能改吗 编辑:程序博客网 时间:2024/05/21 14:00
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.
这是一道动态规划的题目。去年在基因组大数据课上第一次接触动态规划(之前没有学过算法的小白),所以好有点印象,这道题和昨天那道计算有多少条路线的题目区别在于:一个是统计多少条路径,一个是累加value;累加value的时候在左边和上面的格子里取最小值。但是要注意因为会出现i-1和j-1,所以需要进行判断。
public int minPathSum(int[][] grid) { if(grid==null) return 0; int m = grid.length; int n = grid[0].length; int[][] res = new int[m][n]; res[0][0]=grid[0][0]; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(i==0&&j>0) res[i][j]=res[i][j-1]+grid[i][j]; if(j==0&&i>0) res[i][j]=res[i-1][j]+grid[i][j]; else if(i>0&&j>0) res[i][j]=Math.min(res[i-1][j],res[i][j-1])+grid[i][j]; } } return res[m-1][n-1]; }
阅读全文
0 0
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64.Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64. Minimum Path Sum
- 64.Minimum Path Sum
- SpringBoot四大神器之Actuator
- 传教士过河问题
- 40余家服饰品牌撤出京东,折射京东天猫电商第一之争
- SqlServer2000 调用Http接口的存储过程
- 第三周 【项目3
- 64. Minimum Path Sum
- Sublime实现自动排版
- java迭代器并发修改异常说明
- 给定固定长度的字符串,求解按字符字典序排列,该字符串是第几小?
- 浅谈python(一)--初识python
- 子弹射击检测
- python 开头两行
- iOS libsqlite3.0.tbd和libsqlite3.tbd的区别
- HDU-5543 DP