feat: add solutions to lc problem: No.0944

No.0944.Delete Columns to Make Sorted

Author: YangFong

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

@@ -89,6 +89,49 @@ cae</pre>
 
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minDeletionSize(vector<string>& strs) {
+        int n = strs.size();
+        int m = strs[0].size();
+        int res = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n - 1; ++j) {
+                if (strs[j][i] > strs[j + 1][i]) {
+                    res++;
+                    break;
+                }
+            }
+        }
+        return res;
+    }
+};
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_deletion_size(strs: Vec<String>) -> i32 {
+        let n = strs.len();
+        let m = strs[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 1..n {
+                if strs[j - 1].as_bytes()[i] > strs[j].as_bytes()[i] {
+                    res += 1;
+                    break;
+                }
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -80,6 +80,49 @@ All 3 columns are not sorted, so you will delete all 3.
 
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minDeletionSize(vector<string>& strs) {
+        int n = strs.size();
+        int m = strs[0].size();
+        int res = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n - 1; ++j) {
+                if (strs[j][i] > strs[j + 1][i]) {
+                    res++;
+                    break;
+                }
+            }
+        }
+        return res;
+    }
+};
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_deletion_size(strs: Vec<String>) -> i32 {
+        let n = strs.len();
+        let m = strs[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 1..n {
+                if strs[j - 1].as_bytes()[i] > strs[j].as_bytes()[i] {
+                    res += 1;
+                    break;
+                }
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int minDeletionSize(vector<string>& strs) {
+        int n = strs.size();
+        int m = strs[0].size();
+        int res = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n - 1; ++j) {
+                if (strs[j][i] > strs[j + 1][i]) {
+                    res++;
+                    break;
+                }
+            }
+        }
+        return res;
+    }
+};

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

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn min_deletion_size(strs: Vec<String>) -> i32 {
+        let n = strs.len();
+        let m = strs[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 1..n {
+                if strs[j - 1].as_bytes()[i] > strs[j].as_bytes()[i] {
+                    res += 1;
+                    break;
+                }
+            }
+        }
+        res
+    }
+}