feat: add solutions to lc problem: No.0944

No.0944.Delete Columns to Make Sorted

Author: yanglbme

solution/0900-0999/0944.Delete Columns to Make Sorted/README.md

@@ -78,15 +78,38 @@ cae</pre>
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minDeletionSize(self, strs: List[str]) -> int:
+        m, n = len(strs[0]), len(strs)
+        ans = 0
+        for j in range(m):
+            for i in range(1, n):
+                if strs[i][j] < strs[i - 1][j]:
+                    ans += 1
+                    break
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int minDeletionSize(String[] strs) {
+        int m = strs[0].length(), n = strs.length;
+        int ans = 0;
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i].charAt(j) < strs[i - 1].charAt(j)) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **C++**
@@ -132,6 +155,24 @@ impl Solution {
 }
 ```
 
+### **Go**
+
+```go
+func minDeletionSize(strs []string) int {
+	m, n := len(strs[0]), len(strs)
+	ans := 0
+	for j := 0; j < m; j++ {
+		for i := 1; i < n; i++ {
+			if strs[i][j] < strs[i-1][j] {
+				ans++
+				break
+			}
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0944.Delete Columns to Make Sorted/README_EN.md

@@ -71,13 +71,36 @@ All 3 columns are not sorted, so you will delete all 3.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minDeletionSize(self, strs: List[str]) -> int:
+        m, n = len(strs[0]), len(strs)
+        ans = 0
+        for j in range(m):
+            for i in range(1, n):
+                if strs[i][j] < strs[i - 1][j]:
+                    ans += 1
+                    break
+        return ans
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int minDeletionSize(String[] strs) {
+        int m = strs[0].length(), n = strs.length;
+        int ans = 0;
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i].charAt(j) < strs[i - 1].charAt(j)) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **C++**
@@ -123,6 +146,24 @@ impl Solution {
 }
 ```
 
+### **Go**
+
+```go
+func minDeletionSize(strs []string) int {
+	m, n := len(strs[0]), len(strs)
+	ans := 0
+	for j := 0; j < m; j++ {
+		for i := 1; i < n; i++ {
+			if strs[i][j] < strs[i-1][j] {
+				ans++
+				break
+			}
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0944.Delete Columns to Make Sorted/Solution.go

@@ -0,0 +1,13 @@
+func minDeletionSize(strs []string) int {
+	m, n := len(strs[0]), len(strs)
+	ans := 0
+	for j := 0; j < m; j++ {
+		for i := 1; i < n; i++ {
+			if strs[i][j] < strs[i-1][j] {
+				ans++
+				break
+			}
+		}
+	}
+	return ans
+}

solution/0900-0999/0944.Delete Columns to Make Sorted/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int minDeletionSize(String[] strs) {
+        int m = strs[0].length(), n = strs.length;
+        int ans = 0;
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i].charAt(j) < strs[i - 1].charAt(j)) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+}

solution/0900-0999/0944.Delete Columns to Make Sorted/Solution.py

@@ -1,12 +1,10 @@
 class Solution:
-    def minDeletionSize(self, A: 'List[str]') -> 'int':
-
-        count = 0
-
-        for i in range(len(A[0])):
-            for j in range(len(A) - 1):
-                if A[j][i] > A[j + 1][i]:
-                    count += 1
+    def minDeletionSize(self, strs: List[str]) -> int:
+        m, n = len(strs[0]), len(strs)
+        ans = 0
+        for j in range(m):
+            for i in range(1, n):
+                if strs[i][j] < strs[i - 1][j]:
+                    ans += 1
                     break
-
-        return count
+        return ans