add 931

Author: luliyucoordinate

README.md

@@ -170,4 +170,5 @@ LeetCode
 |0926|[Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing/) | c | [c++](./src/0926-Flip-String-to-Monotone-Increasing/0926.cpp) |[python](./src/0926-Flip-String-to-Monotone-Increasing/0926.py)|||Medium|
 |0927|[Three Equal Parts](https://leetcode.com/problems/three-equal-parts/) | c | [c++](./src/0927-Three-Equal-Parts/0927.cpp) |[python](./src/0927-Three-Equal-Parts/0927.py)|||Medium|
 |0929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | c | [c++](./src/0925-Long-Pressed-Name/0925.cpp) |[python](./src/0925-Long-Pressed-Name/0925.py)|||Easy|
-|0930|[Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum/) | c | [c++](./src/0927-Three-Equal-Parts/0927.cpp) |[python](./src/0927-Three-Equal-Parts/0927.py)|||Medium|
+|0930|[Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum/) | c | [c++](./src/0927-Three-Equal-Parts/0927.cpp) |[python](./src/0927-Three-Equal-Parts/0927.py)|||Medium|
+|0931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | c | [c++](./src/0927-Three-Equal-Parts/0927.cpp) |[python](./src/0927-Three-Equal-Parts/0927.py)|||Medium|

src/0931-Minimum-Falling-Path-Sum/0931.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    int minFallingPathSum(vector<vector<int>>& A) 
+    {
+        if (A.empty()) return 0;
+        unsigned int r = A.size(), c = A[0].size();
+        for (int row = r - 1; row > 0; --row)
+        {
+            for (unsigned int col = 0; col < c; ++col)
+            {
+                if (col == 0)
+                    A[row - 1][col] += min(A[row][col], A[row][col + 1]);
+                else if (col == c - 1)
+                    A[row - 1][col] += min(A[row][col], A[row][col - 1]);
+                else A[row - 1][col] += min(A[row][col], min(A[row][col + 1], A[row][col - 1]));
+            }
+        }
+        return *min_element(A[0].begin(), A[0].end());
+    }
+};
+int main()
+{
+    vector<vector<int>> nums = {{-19,57},{-40,-5}};
+    cout << Solution().minFallingPathSum(nums);
+    return 0;
+}

src/0931-Minimum-Falling-Path-Sum/0931.py

@@ -0,0 +1,24 @@
+class Solution:
+    def minFallingPathSum(self, A):
+        """
+        :type A: List[List[int]]
+        :rtype: int
+        """
+        if not A:
+            return 0
+
+        r, c = len(A), len(A[0])
+        for row in range(r - 1, 0, -1):
+            for col in range(c):
+                if col == 0:
+                    A[row - 1][col] += min(A[row][col], A[row][col + 1])
+                elif col == c - 1:
+                    A[row - 1][col] += min(A[row][col], A[row][col - 1])
+                else:
+                    A[row - 1][col] += min(A[row][col], A[row][col + 1], A[row][col - 1])
+
+        return min(A[0])
+
+if __name__ == "__main__":
+    A = [[-19,57],[-40,-5]]
+    print(Solution().minFallingPathSum(A))