@@ -0,0 +1,1191 @@
+package leetcode.triangle;%0A%0Aimport java.util.ArrayList;%0Aimport java.util.Arrays;%0A%0Apublic class Solution %7B%0A    public int minimumTotal(ArrayList%3CArrayList%3CInteger%3E%3E triangle) %7B%0A        if(triangle == null %7C%7C triangle.size() == 0) return 0;%0A        int size = triangle.size();%0A        for(int i = size - 1; i %3E 0; i--)%7B%0A        %09for(int j = 0; j %3C i; j++)%7B%0A        %09%09ArrayList%3CInteger%3E row_i = triangle.get(i);%0A        %09%09ArrayList%3CInteger%3E row_i_1 = triangle.get(i - 1);%0A        %09%09int a = row_i.get(j);%0A        %09%09int b = row_i.get(j + 1);%0A        %09%09int v = row_i_1.get(j);%0A        %09%09row_i_1.set(j, v + Math.min(a, b));%0A        %09%7D%0A        %7D%0A        return triangle.get(0).get(0);%0A    %7D%0A    public static void main(String%5B%5D args)%7B%0A    %09ArrayList%3CArrayList%3CInteger%3E%3E input = new ArrayList%3CArrayList%3CInteger%3E%3E();%0A    %09input.add(new ArrayList%3CInteger%3E(Arrays.asList(new Integer%5B%5D%7B2%7D)));%0A    %09input.add(new ArrayList%3CInteger%3E(Arrays.asList(new Integer%5B%5D%7B3, 4%7D)));%0A    %09input.add(new ArrayList%3CInteger%3E(Arrays.asList(new Integer%5B%5D%7B6, 5, 7%7D)));%0A    %09input.add(new ArrayList%3CInteger%3E(Arrays.asList(new Integer%5B%5D%7B4, 1, 8, 3%7D)));%0A    %09System.err.println(new Solution().minimumTotal(input) + %22%22);%0A    %7D%0A%7D%0A

Add java solution for 120. Triangle