Minimum Falling Path Sum II
Given an n x n integer matrix grid, return the minimum sum of a falling path with non-zero shifts.
A falling path with non-zero shifts is a choice of exactly one element from each row of grid such that no two elements chosen in adjacent rows are in the same column.
Example 1
1 2 3 4 5 6 7 8 9
Input
grid = [[1,2,3],[4,5,6],[7,8,9]]Output
13The falling path with the smallest sum is [1, 5, 7], so the answer is 13.
Example 2
7
Input
grid = [[7]]Output
7The only possible falling path is [7], so the minimum sum is 7.
Constraints
- n == grid.length == grid[i].length
- 1 <= n <= 200
- -99 <= grid[i][j] <= 99