【leetcode】Minimum Path Sum
来源:互联网 发布:八门神器ios源码 编辑:程序博客网 时间:2024/05/19 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.
二、问题分析
这道题跟unique path是完全一样的,可以看这里
三、Java AC 代码
public int minPathSum(int[][] grid) {if (grid==null || grid.length==0) {return 0;}int row = grid.length;int col = grid[0].length;int[][] dp = new int[row][col];dp[0][0] = grid[0][0];for (int i = 1; i < row; i++) {dp[i][0] = dp[i-1][0]+grid[i][0];}for (int i = 1; i < col; i++) {dp[0][i] = dp[0][i-1]+grid[0][i];}for (int i = 1; i < row; i++) {for (int j = 1; j < col; j++) {dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1])+grid[i][j];}}return dp[row-1][col-1];}
0 0
- LeetCode: Minimum Path Sum
- LeetCode Minimum Path Sum
- LeetCode : Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode] Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode]Minimum Path Sum
- [leetcode]Minimum Path Sum
- LeetCode-Minimum Path Sum
- [leetcode] Minimum Path Sum
- LeetCode - Minimum Path Sum
- LeetCode:Minimum Path Sum
- leetcode minimum path sum
- 【leetcode】Minimum Path Sum
- 【LeetCode】Minimum Path Sum
- Leetcode: Minimum Path Sum
- Leetcode Minimum Path Sum
- LeetCode Minimum Path Sum
- XMLHttpRequest
- Java虚拟机-----方法区和运行时常量池
- URL访问网站的过程(三次握手、四次挥手),发送RST包的四种情况,常用协议
- SharePoint 2013 开发教程
- 协议森林07 傀儡 (UDP协议)
- 【leetcode】Minimum Path Sum
- android activity监听加载完毕事件
- 判断从出生到18岁生日一共度过了多少天
- Java中的private、protected、public和default的区别
- Android studio 导入github工程
- 数据库的范式
- struts2 基础入门
- Java开发中的23种设计模式详解(转)
- 把样式写进html编辑器弊端