|
1 | 1 | packagecom.fishercoder.solutions; |
2 | 2 |
|
3 | | -/** |
4 | | - * 931. Minimum Falling Path Sum |
5 | | - * |
6 | | - * Given a square array of integers A, we want the minimum sum of a falling path through A. |
7 | | - * A falling path starts at any element in the first row, and chooses one element from each row. |
8 | | - * The next row's choice must be in a column that is different from the previous row's column by at most one. |
9 | | - * |
10 | | - * Example 1: |
11 | | - * Input: [[1,2,3],[4,5,6],[7,8,9]] |
12 | | - * Output: 12 |
13 | | - * Explanation: |
14 | | - * The possible falling paths are: |
15 | | - * [1,4,7], [1,4,8], [1,5,7], [1,5,8], [1,5,9] |
16 | | - * [2,4,7], [2,4,8], [2,5,7], [2,5,8], [2,5,9], [2,6,8], [2,6,9] |
17 | | - * [3,5,7], [3,5,8], [3,5,9], [3,6,8], [3,6,9] |
18 | | - * The falling path with the smallest sum is [1,4,7], so the answer is 12. |
19 | | - * |
20 | | - * Note: |
21 | | - * 1 <= A.length == A[0].length <= 100 |
22 | | - * -100 <= A[i][j] <= 100 |
23 | | - * */ |
24 | 3 | publicclass_931 { |
25 | 4 | publicstaticclassSolution1 { |
26 | 5 | publicintminFallingPathSum(int[][]A) { |
|