leetcode, algorithms

leetcode/algorithms/931 - Minimum Falling Path Sum

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int minFallingPathSum(vector<vector<int>>& matrix) {
+        const int rows = matrix.size();
+        const int cols = matrix[0].size();
+        vector<vector<int>> dp(rows, vector<int>(cols, INT_MAX));
+        dp[0] = matrix[0];
+        for (int i = 1; i < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                dp[i][j] = min(dp[i][j], dp[i - 1][j]);
+                if (j > 0) dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);
+                if (j < cols - 1) dp[i][j] = min(dp[i][j], dp[i - 1][j + 1]);
+                dp[i][j] += matrix[i][j];
+            }
+        }
+        int res = INT_MAX;
+        for (int i = 0; i < cols; i++) {
+            res = min(res, dp[rows - 1][i]);
+        }
+        return res;
+    }
+};