LeetCode120 Triangle（带记忆化搜索的动态规划 递归实现）

Given a triangle, find the minimum path sum from top to bottom. Each step you may 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 from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).

Note:

Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

class Solution {
    public static int minimumTotal(List<List<Integer>> triangle) {
        int[][] memo = new int[triangle.size()][triangle.size()];//记忆化数组
        return find(triangle,0,0,memo);
    }
    public static int find(List<List<Integer>> triangle,int i,int j,int[][] memo) {
        if(triangle.size()==1)
            return triangle.get(j).get(i);
        if(j==triangle.size()-1){
            if(triangle.get(j).size()-2>=i) {
                if(memo[i][j]==0) {
                    memo[i][j] = Math.min(triangle.get(j).get(i), triangle.get(j).get(i + 1));
                }
                return memo[i][j];
            }
            else
                return Integer.MAX_VALUE;
        }
        if(j+1==triangle.size()-1){
            if(memo[i][j]==0){
                memo[i][j] = find(triangle,i,j+1,memo)+triangle.get(j).get(i);
            }
            return memo[i][j];
        }
        if(memo[i][j]==0){
            memo[i][j]=Math.min(find(triangle,i,j+1,memo),find(triangle,i+1,j+1,memo))+triangle.get(j).get(i);
        }
        return memo[i][j];
    }
}