add 960

Author: luliyucoordinate

README.md

@@ -253,6 +253,7 @@ LeetCode
 |0957|[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) | c | [c++](./src/0957-Prison-Cells-After-N-Days/0957.cpp) |[python](./src/0957-Prison-Cells-After-N-Days/0957.py)|||Medium|
 |0958|[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) | c | [c++](./src/0958-Check-Completeness-of-a-Binary-Tree/0958.cpp) |[python](./src/0958-Check-Completeness-of-a-Binary-Tree/0958.py)|||Medium|
 |0959|[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/) | c | [c++](./src/0959-Regions-Cut-By-Slashes/0959.cpp) |[python](./src/0959-Regions-Cut-By-Slashes/0959.py)|||Medium|
+|0960|[Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii/) | c | [c++](./src/0960-Delete-Columns-to-Make-Sorted-III/0960.cpp) |[python](./src/0960-Delete-Columns-to-Make-Sorted-III/0960.py)|||Hard|
 |0961|[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | c | [c++](./src/0961-N-Repeated-Element-in-Size-2N-Array/0961.cpp) |[python](./src/0961-N-Repeated-Element-in-Size-2N-Array/0961.py)|||Easy|
 |0962|[Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/) | c | [c++](./src/0962-Maximum-Width-Ramp/0962.cpp) |[python](./src/0962-Maximum-Width-Ramp/0962.py)|||Medium|
 |0963|[Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii/) | c | [c++](./src/0963-Minimum-Area-Rectangle-II/0963.cpp) |[python](./src/0963-Minimum-Area-Rectangle-II/0963.py)|||Medium|

src/0960-Delete-Columns-to-Make-Sorted-III/0960.cpp

@@ -0,0 +1,21 @@
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    int minDeletionSize(vector<string>& A) 
+    {
+        vector<int> mem(A[0].size(), 1);
+        for (int i = 0; i < A[0].size(); ++i) 
+        {
+            for (int j = 0; j < i; ++j)
+            {
+                for (int k = 0; k <= A.size(); ++k) 
+                {
+                    if (k == A.size()) mem[i] = max(mem[i], mem[j] + 1);
+                    else if (A[k][j] > A[k][i]) break;
+                }               
+            }
+        }
+        return A[0].size() - *max_element(begin(mem), end(mem));
+    }
+};

src/0960-Delete-Columns-to-Make-Sorted-III/0960.py

@@ -0,0 +1,17 @@
+class Solution:
+    def minDeletionSize(self, A):
+        """
+        :type A: List[str]
+        :rtype: int
+        """
+        r, c = len(A), len(A[0])
+        mem = [1] * c
+        for i in range(1, c):
+            for j in range(i):
+                for k in range(r+1):  
+                    if k == r:
+                        mem[i] = max(mem[i], mem[j] + 1)
+                    elif A[k][j] > A[k][i]:
+                        break
+                        
+        return c - max(mem)