Time: 11 ms (80.62%), Space: 13.2 MB (5.08%) - LeetHub

Author: knockcat

0931-minimum-falling-path-sum/0931-minimum-falling-path-sum.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    int minFallingPathSum(vector<vector<int>>& A) {
+         int m = A.size();
+        vector<vector<int>> t(m, vector<int>(m));
+        
+        for(int col = 0; col<m; col++) {
+            t[0][col] = A[0][col];
+        }
+        
+        for(int row = 1; row < m; row++) {
+            for(int col = 0; col < m; col++) {
+                t[row][col] = A[row][col] + min({t[row-1][col], 
+                                                 t[row-1][max(0, col-1)], 
+                                                 t[row-1][min(m-1, col+1)]});
+            }
+        }
+
+        return *min_element(t[m-1].begin(), t[m-1].end());
+    }
+};