动态规划10(Leetcode120三角形最小路径和)

class Solution {
    public int minimumTotal(List> triangle) {
        int n = triangle.size();
        int[][] sum = new int[n][n];
        sum[0][0] = triangle.get(0).get(0);
        for(int i=1;i

你可能感兴趣的:(动态规划,算法)