【动态规划】leetcode120 三角形最小路径和
题目详情
dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j]) + nums[i][j]
public class Solution {
public int minimumTotal(List<List<Integer>> triangle){
if(triangle.size() == 0)
return 0;
if(triangle.size() == 1)
return triangle.get(0).get