64.Minimum Path Sum：修订间差异
Created page with "=Description= {{LeetCode |id=minimum-path-sum |no=64 |difficulty=Medium |category=Dynamic Programming |collection=Top 150 |title=Minimum Path Sum |summary=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. Example 1: <syntaxhighlight lang="java"> Input: grid = [[1,3,1],[1,5,1],[4,2,1]] Output: 7 </synt..." |
|||
| 第26行： | 第26行： | ||
Output: 12 | Output: 12 | ||
</syntaxhighlight> | </syntaxhighlight> | ||
=Solution= | |||
==DP+DFS== | |||
[[Category:Algorithm]] | |||
[[Category:Dynamic Programming]] | |||
[[Category:LeetCode]] | |||
2023年9月23日 (六) 10:43的版本
Description
 |
#64 | Minimum Path Sum | Medium | |
|---|---|---|---|---|
| Dynamic Programming | Top 150 | |||
| 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.
Example 1:
Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.
Example 2:
Input: grid = [[1,2,3],[4,5,6]]
Output: 12