Leetcode: Triangle_leetcode

Given a triangle, find the minimum path sum from top to bottom. Each step you'll move to adjacent numbers on the row below.

For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum is one bottom (i.e., 2 + 3 + 5 + 1 = 11).

Given an array to represent a triangle, find out which and the smallest path

Solution: A DFS-like idea

Code:

public class Solution {public
    int minimumtotal (list<list<integer>> triangle) {
        if triangle.size ( ) = = 0) {return
            0;
        }

        for (int i = Triangle.size ()-2; I >= 0;-l) {for
            (int j = 0; J <= i; ++j) {
                list<integer> next = Trian Gle.get (i + 1);

                int sum = Math.min (Next.get (j), Next.get (j + 1)) + Triangle.get (i). get (j);
                Triangle.get (i). Set (J, sum);
            }

        Return Triangle.get (0). Get (0);
    }
}