[LeetCode] Top Interview 150 Problems Solving # 120 Triangle
Understanding the Problem
There is a pyramid given with the length of n. From the bottom to top, the length of the floor is narrowed by 1.
# input
triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
# output
11
# visualised triangle
2
3 4
6 5 7
4 1 8 3
...
ramieeee.me2 min read