2021
11-09
11-09
C++实现LeetCode(120.三角形)
[LeetCode]120.Triangle三角形Givenatriangle,findtheminimumpathsumfromtoptobottom.Eachstepyoumaymovetoadjacentnumbersontherowbelow.Forexample,giventhefollowingtriangle[[2],[3,4],[6,5,7],[4,1,8,3]]Theminimumpathsumfromtoptobottomis 11 (i.e., 2 + 3 + 5 + 1 =11).Note:Bonuspointifyouareabletodothisusingonl...
继续阅读 >