LeetCode Minimum Path Sum
来源:互联网 发布:嵌入式linux入门教材 编辑:程序博客网 时间:2024/06/05 20:35
Description:
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.
Solution:
经典的DP题目
还有一种出法是给一个长得像杨辉三角的三角形,求从顶端到最底层的最短路径和。
这里的状态转移方程就是dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
import java.util.*;public class Solution {public int minPathSum(int[][] grid) {int m = grid.length;int n = grid[0].length;int dp[][] = new int[m][n];dp[0][0] = grid[0][0];for (int i = 1; i < n; i++)dp[0][i] = dp[0][i - 1] + grid[0][i];for (int i = 1; i < m; i++)dp[i][0] = dp[i - 1][0] + grid[i][0];for (int i = 1; i < m; i++)for (int j = 1; j < n; j++)dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];return dp[m - 1][n - 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
- 手机APP UI设计尺寸基础知识
- 1012--映射一对多关联关系(.双向 1-n)
- 存储过程与事务
- android 中 图形缩放
- nyoj216
- LeetCode Minimum Path Sum
- Linux中vi操作详细
- PAT 打印沙漏 (Python)
- ubuntu中设置静态IP
- java自带线程池和队列详细讲解
- FFTW的使用
- matlab 字符串处理函数
- Linux创建删除文件夹、文件
- oracle 数据库查询