[LeetCode] 1289. 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