阿牧遥

摘要： 简单动态规划。public class Solution { public int minimumTotal(ArrayList> triangle) { int len = triangle.size(); if (len == 0) return 0; int[] sum = new int[len]; sum[0] = triangle.get(0).get(0); for (int i = 1; i arr = triangle.get(i); int tmp = sum[0]; ... 阅读全文