题解 | #三角形最小路径和#
三角形最小路径和
https://www.nowcoder.com/practice/c9d44b73dc7c4dbfa4272224b1f9b42c
class Solution:
def minTrace(self , triangle: List[List[int]]) -> int:
n = len(triangle)
while n-1 > 0:
for i in range(0 , n-1):
triangle[n-2][i] = min(triangle[n-1][i],triangle[n-1][i+1]) + triangle[n-2][i]
n -=1
return triangle[0][0]
查看17道真题和解析
