feat: add cs solution to lc problem: No.0944

Author: yanglbme

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

@@ -208,6 +208,29 @@ impl Solution {
 }
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int MinDeletionSize(string[] strs) {
+        int m = strs[0].Length;
+        int n = strs.Length;
+        int ans = 0;
+
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i][j] < strs[i - 1][j]) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -211,6 +211,29 @@ impl Solution {
 }
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int MinDeletionSize(string[] strs) {
+        int m = strs[0].Length;
+        int n = strs.Length;
+        int ans = 0;
+
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i][j] < strs[i - 1][j]) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,18 @@
+public class Solution {
+    public int MinDeletionSize(string[] strs) {
+        int m = strs[0].Length;
+        int n = strs.Length;
+        int ans = 0;
+
+        for (int j = 0; j < m; ++j) {
+            for (int i = 1; i < n; ++i) {
+                if (strs[i][j] < strs[i - 1][j]) {
+                    ++ans;
+                    break;
+                }
+            }
+        }
+
+        return ans;
+    }
+}