package leetcode;

/**
 * https://leetcode.com/problems/minimum-falling-path-sum/
 */
public class Problem931 {
    public int minFallingPathSum(int[][] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem931 prob = new Problem931();
    }
}

@@ -281,16 +281,166 @@
 m931();%0A
+        System.out.println(prob.minFallingPathSum(new int%5B%5D%5B%5D%7B%0A            %7B1, 2, 3%7D,%0A            %7B4, 5, 6%7D,%0A            %7B7, 8, 9%7D%0A        %7D)); // 12%0A
     %7D%0A%7D%0A

Update problem 931