leetcode 64. Minimum Path Sum
来源:互联网 发布:教乐器软件下载 编辑:程序博客网 时间:2024/05/21 13:23
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.
还是这道题的变形:
上次在每个格子里放01 这次放正整数
之前dp[i][j] 表示路径的数目 采用dp[i+1][j]+dp[i][j+1]
这个dp[i][j]表示路径长度 所以要采用 max(dp[i+1][j] ,dp[i][j+1] ) +grid[i][j]
public int minPathSum(int[][] grid) { int m = grid.length; if(m == 0) return 0; int n = grid[0].length; int[][] dp = new int[m][n]; int i,j; for(int index = m*n-1;index >= 0;index--){ i = index / n; j = index % n; if(index == m*n-1) dp[i][j] = grid[i][j]; else{ dp[i][j] = grid[i][j]; if(i+1 >= m) dp[i][j] += dp[i][j+1]; else if(j+1 >= n) dp[i][j] += dp[i+1][j] ; else{ dp[i][j] += Integer.min(dp[i+1][j], dp[i][j+1]); } } }// for(i = 0;i < m;i++){// for(j = 0;j < n;j++)// System.out.printf("%4d",dp[i][j]);// System.out.println();// } return dp[0][0]; }
0 0
- [LeetCode]64.Minimum Path Sum
- LeetCode --- 64. Minimum Path Sum
- LeetCode 64.Minimum Path Sum
- [Leetcode] 64. Minimum Path Sum
- [leetcode] 64.Minimum Path Sum
- [leetcode] 64.Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- 64. Minimum Path Sum LeetCode
- [LeetCode]64. Minimum Path Sum
- leetcode 64. Minimum Path Sum
- [leetcode] 64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- LeetCode *** 64. Minimum Path Sum
- leetcode 64. Minimum Path Sum
- 【leetcode】64. Minimum Path Sum
- Leetcode:64. Minimum Path Sum
- LeetCode-64.Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- AWS EC2上搭建Cassandra集群到底如何呢?
- 因为孩子上学而搬家的故事
- HashTable 解决碰撞(冲突)的方法 —— 分离链接法(separate chaining)
- Sqlserver数据库通知应用程序
- 自动获取cell高度的第三方
- leetcode 64. Minimum Path Sum
- 数据库基础知识复习
- swift 对于NSDate日期获取年月日及其他操作
- 此谓生活-概述篇
- Android借鉴支付宝的思路解决 GridView网格线粗细的问题
- TCP/IP、Http、Socket的区别
- ABAP:SAP报表性能的优化
- PHP模拟登录并获取数据
- SQL 优化SQL查询:如何写出高性能SQL语句-- sql执行计划