Minimum Falling Path Sum

Given a square array of integers A, we want the minimum sum of a falling path through A.

A falling path starts at any element in the first row, and chooses one element from each row.  The next row's choice must be in a column that is different from the previous row's column by at most one.

Example 1:

Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: 12
Explanation: 
The possible falling paths are:

• [1,4,7], [1,4,8], [1,5,7], [1,5,8], [1,5,9]
• [2,4,7], [2,4,8], [2,5,7], [2,5,8], [2,5,9], [2,6,8], [2,6,9]
• [3,5,7], [3,5,8], [3,5,9], [3,6,8], [3,6,9]

The falling path with the smallest sum is [1,4,7], so the answer is 12.

思路：这题说的题意是：当前层跟上一层，只能有一个col diff，也就是说dp[i][j] = A[i][j] + Math.min(dp[i-1][j-1], dp[i-1][j], dp[i-1][j+1]);

注意左右两边的情况判断；Math.max(0, j -1), Math.min(n -1, j + 1)这个很巧妙；O(N*N)

class Solution {
    public int minFallingPathSum(int[][] A) {
        if(A == null || A.length == 0 || A[0].length == 0) {
            return 0;
        }
        int n = A.length;
        int[][] dp = new int[n][n];
        // initial 1st row;
        for(int j = 0; j < n; j++) {
            dp[0][j] = A[0][j];
        }
        
        // calculate matrix;
        for(int i = 1; i < n; i++) {
            for(int j = 0; j < n; j++) {
                int topleft = dp[i - 1][Math.max(0, j - 1)];
                int topright = dp[i - 1][Math.min(n - 1, j + 1)];
                dp[i][j] = A[i][j] + Math.min(dp[i - 1][j], Math.min(topleft, topright));
            }
        }
        
        // find minimum in last row;
        int res = dp[n - 1][0];
        for(int j = 1; j < n; j++) {
            res = Math.min(res, dp[n - 1][j]);
        }
        return res;
    }
}

思路2：这题也可以用top down，记忆化搜索做。

class Solution {
    public int minFallingPathSum(int[][] A) {
        int n = A.length;
        int m = A[0].length;
        Integer[][] dp = new Integer[n][m];
        int min = Integer.MAX_VALUE;
        for(int j = 0; j < m; j++) {
            min = Math.min(min, dfs(A, 0, j, dp));
        }
        return min;
    }
    
    private int dfs(int[][] A, int i, int j, Integer[][] dp) {
        if(i == A.length) {
            return 0;
        }
        if(dp[i][j] != null) {
            return dp[i][j];
        }
        int res = Integer.MAX_VALUE;
        for(int x = Math.max(0, j - 1); x <= Math.min(A[0].length - 1, j + 1); x++) {
            res = Math.min(res, A[i][j] + dfs(A, i + 1, x, dp));
        }
        dp[i][j] = res;
        return dp[i][j];
    }
}