120.Triangle：修订间差异
Created page with "==Description== ==Solution== Category:Algorithm Category:Dynamic Programming Category:LeetCode" |
|||
| 第1行： | 第1行： | ||
==Description== | ==Description== | ||
https://leetcode.com/problems/triangle/ | |||
Given a triangle array, return the minimum path sum from top to bottom. | |||
For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row. | |||
Example 1: | |||
<syntaxhighlight lang="java"> | |||
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]] | |||
Output: 11 | |||
</syntaxhighlight> | |||
Explanation: The triangle looks like: | |||
<syntaxhighlight lang="java"> | |||
2 | |||
3 4 | |||
6 5 7 | |||
4 1 8 3 | |||
</syntaxhighlight> | |||
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above). | |||
Example 2: | |||
<syntaxhighlight lang="java"> | |||
Input: triangle = [[-10]] | |||
Output: -10 | |||
</syntaxhighlight> | |||
==Solution== | ==Solution== | ||
2023年9月23日 (六) 03:56的版本
Description
https://leetcode.com/problems/triangle/
Given a triangle array, return the minimum path sum from top to bottom.
For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.
Example 1:
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output: 11
Explanation: The triangle looks like:
2
3 4
6 5 7
4 1 8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
Example 2:
Input: triangle = [[-10]]
Output: -10