single
Problem C. Minimum Path in Triangle
Stryg for at vise menuen
The tasks in this section contain test function calls. Please do not change this code; otherwise, the assignment may not be accepted.
Given a triangle array. The bird starts at the top, and for each step, it can move either left or right down (if it is on the index j at the current row, it can move to j or j+1 position on the next row). Return the minimum path cost among all possible paths from top to bottom.
Example 1
The orange path is minimum and costs 12.
Example 2
Input: triangle = [[1],
[2, 1],
[8, 3, 7],
[5, 2, 6, 1]]
Output: 7
Explanation: The path looks like:
Stryg for at begynde at kode
Implement a function minPath() for triangle array.
- Find the rule for shortest path in
triangle[i][j]. - Define the rule for corner cases.
Løsning
Skift til skrivebord for at øve i den virkelige verdenFortsæt der, hvor du er, med en af nedenstående mulighederTak for dine kommentarer!
single
Spørg AI
Spørg AI
Spørg om hvad som helst eller prøv et af de foreslåede spørgsmål for at starte vores chat
