Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
Adjacent numbers for jth number of row i is jth and (j+1)th numbers of row i+1 is
1 <= |A| <= 1000
1 <= A[i] <= 1000
First and only argument is the vector of vector A defining the given triangle
Return the minimum sum
A = [ , [3, 4], [6, 5, 7], [4, 1, 8, 3] ]
A = [  ]
The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).
Only 2 can be collected.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.