#931 Minimum Falling Path Sum

Description

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

A falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right. Specifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, col + 1).

Examples

Example 1:

Input: matrix = [[2,1,3],[6,5,4],[7,8,9]]
Output: 13
Explanation: There are two falling paths with a minimum sum as shown.

Example 2:

Input: matrix = [[-19,57],[-40,-5]]
Output: -59
Explanation: The falling path with a minimum sum is shown.

Constraints:

n == matrix.length == matrix[i].length
1 <= n <= 100
-100 <= matrix[i][j] <= 100

思路

这个感觉和之前被我错认成二叉树的金字塔一样啊，更新matrix内部的值就可以了

代码

class Solution {
    public int minFallingPathSum(int[][] matrix) {
        int n = matrix.length;
        if (n == 1)
            return matrix[0][0];
        
        for (int i = 1; i < n; i++) {
            matrix[i][0] = Math.min(matrix[i - 1][0], matrix[i - 1][1]) + matrix[i][0];
            for (int j = 1; j < n - 1; j++)
                matrix[i][j] = Math.min(Math.min(matrix[i - 1][j], matrix[i - 1][j - 1]), matrix[i - 1][j + 1]) + matrix[i][j];
            
            matrix[i][n - 1] = Math.min(matrix[i - 1][n - 1], matrix[i - 1][n - 2]) + matrix[i][n - 1];
        }
        
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < n; i++)
            min = Math.min(min, matrix[n - 1][i]);
        
        return min;
    }
}