LeetCode Minimum Path Sum(动态规划)

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.

题意：给出一个非负矩阵，求从左上角到右下角的路径和的最小值

思路：用dp(i,j)表示从(0,0)到(i,j)的路径的最小和，因为移动路径只能是向下和向右，状态转移方程为

dp(i,j)= min(dp(i-1,j) + grid[i][j], dp(i,j-1) + grid[i][j])

代码如下：

class Solution {public int minPathSum(int[][] grid){int row = grid.length;int col = row == 0 ? 0 : grid[0].length;int[][] temp = new int[row][col];for (int i = 0; i < row; i++){Arrays.fill(temp[i], Integer.MAX_VALUE);}temp[0][0] = grid[0][0];for (int i = 0; i < row; i++){for (int j = 0; j < col; j++){if (i == 0 && j == 0) continue;if (i > 0){temp[i][j] = Math.min(temp[i][j], temp[i - 1][j] + grid[i][j]);}if (j > 0){temp[i][j] = Math.min(temp[i][j], temp[i][j - 1] + grid[i][j]);}}}return temp[row - 1][col - 1];}
}

LeetCode Minimum Path Sum(动态规划)相关推荐

[leetcode] Minimum Path Sum
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to b ...
LeetCode:Minimum Path Sum（网格最大路径和）
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which ...
【DP】LeetCode 64. Minimum Path Sum
LeetCode 64. Minimum Path Sum Solution1:标准的动态规划题目 class Solution { public:int minPathSum(vector<v ...
【leetcode】Minimum Path Sum
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to b ...
63. Unique Paths II and 64. Minimum Path Sum
文章目录 1 63 Unique Paths II 1.1 题目描述 1.2 动态规划解决 2 64. Minimum Path Sum 2.1 题目理解 2.2 动态规划这一遍刷dp的题目就很轻松 ...
[勇者闯LeetCode] 112. Path Sum
[勇者闯LeetCode] 112. Path Sum Description Given a binary tree and a sum, determine if the tree has a r ...
[LeetCode]113.Path Sum II
[题目] Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the giv ...
leetcode 112. Path Sum, 113. Path Sum II | 112,113. 路径总和 I, II（Java）
题目 https://leetcode.com/problems/path-sum/ https://leetcode.com/problems/path-sum-ii/ 题解简单的遍历二叉树,不解 ...
LeetCode 113. Path Sum II
113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each path's sum eq ...

LeetCode Minimum Path Sum(动态规划)

LeetCode Minimum Path Sum(动态规划)相关推荐

最新文章

热门文章