feat: add cs solutions to lc problem: No.0064. Minimum Path Sum

Author: yanglbme

solution/0000-0099/0064.Minimum Path Sum/README.md

@@ -149,6 +149,34 @@ func min(a, b int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinPathSum(int[][] grid) {
+        int m = grid.Length, n = grid[0].Length;
+        int[,] dp = new int[m, n];
+        dp[0, 0] = grid[0][0];
+        for (int i = 1; i < m; ++i)
+        {
+            dp[i, 0] = dp[i - 1, 0] + grid[i][0];
+        }
+        for (int j = 1; j < n; ++j)
+        {
+            dp[0, j] = dp[0, j - 1] + grid[0][j];
+        }
+        for (int i = 1; i < m; ++i)
+        {
+            for (int j = 1; j < n; ++j)
+            {
+                dp[i, j] = Math.Min(dp[i - 1, j], dp[i, j - 1]) + grid[i][j];
+            }
+        }
+        return dp[m- 1, n - 1];
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0064.Minimum Path Sum/README_EN.md

@@ -137,6 +137,34 @@ func min(a, b int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinPathSum(int[][] grid) {
+        int m = grid.Length, n = grid[0].Length;
+        int[,] dp = new int[m, n];
+        dp[0, 0] = grid[0][0];
+        for (int i = 1; i < m; ++i)
+        {
+            dp[i, 0] = dp[i - 1, 0] + grid[i][0];
+        }
+        for (int j = 1; j < n; ++j)
+        {
+            dp[0, j] = dp[0, j - 1] + grid[0][j];
+        }
+        for (int i = 1; i < m; ++i)
+        {
+            for (int j = 1; j < n; ++j)
+            {
+                dp[i, j] = Math.Min(dp[i - 1, j], dp[i, j - 1]) + grid[i][j];
+            }
+        }
+        return dp[m- 1, n - 1];
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0064.Minimum Path Sum/Solution.cs

@@ -0,0 +1,23 @@
+public class Solution {
+    public int MinPathSum(int[][] grid) {
+        int m = grid.Length, n = grid[0].Length;
+        int[,] dp = new int[m, n];
+        dp[0, 0] = grid[0][0];
+        for (int i = 1; i < m; ++i)
+        {
+            dp[i, 0] = dp[i - 1, 0] + grid[i][0];
+        }
+        for (int j = 1; j < n; ++j)
+        {
+            dp[0, j] = dp[0, j - 1] + grid[0][j];
+        }
+        for (int i = 1; i < m; ++i)
+        {
+            for (int j = 1; j < n; ++j)
+            {
+                dp[i, j] = Math.Min(dp[i - 1, j], dp[i, j - 1]) + grid[i][j];
+            }
+        }
+        return dp[m- 1, n - 1];
+    }
+}

solution/0000-0099/0099.Recover Binary Search Tree/README.md

@@ -58,6 +58,7 @@ class Solution:
     first = None
     second = None
     prev = None
+
     def recoverTree(self, root: TreeNode) -> None:
         """
         Do not return anything, modify root in-place instead.

solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md

@@ -51,6 +51,7 @@ class Solution:
     first = None
     second = None
     prev = None
+
     def recoverTree(self, root: TreeNode) -> None:
         """
         Do not return anything, modify root in-place instead.

solution/0000-0099/0099.Recover Binary Search Tree/Solution.py

@@ -8,6 +8,7 @@ class Solution:
     first = None
     second = None
     prev = None
+
     def recoverTree(self, root: TreeNode) -> None:
         """
         Do not return anything, modify root in-place instead.

solution/0500-0599/0589.N-ary Tree Preorder Traversal/README.md

@@ -68,15 +68,17 @@ class Node:
         self.children = children
 """
 
+
 class Solution:
     def preorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
             res.append(root.val)
             for i in root.children:
                 PO(i)
-        res=[]
+        res = []
         PO(root)
         return res
 ```

solution/0500-0599/0589.N-ary Tree Preorder Traversal/README_EN.md

@@ -55,15 +55,17 @@ class Node:
         self.children = children
 """
 
+
 class Solution:
     def preorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
             res.append(root.val)
             for i in root.children:
                 PO(i)
-        res=[]
+        res = []
         PO(root)
         return res
 ```

solution/0500-0599/0589.N-ary Tree Preorder Traversal/Solution.py

@@ -6,14 +6,16 @@ def __init__(self, val=None, children=None):
         self.children = children
 """
 
+
 class Solution:
     def preorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
             res.append(root.val)
             for i in root.children:
                 PO(i)
-        res=[]
+        res = []
         PO(root)
         return res

solution/0500-0599/0590.N-ary Tree Postorder Traversal/README.md

@@ -68,18 +68,21 @@ class Node:
         self.val = val
         self.children = children
 """
+
+
 class Solution:
     def postorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
-            if root==None:
+            if root == None:
                 return res
             else:
                 for i in root.children:
                     PO(i)
                     res.append(i.val)
-        res=[]
+        res = []
         PO(root)
         res.append(root.val)
         return res

solution/0500-0599/0590.N-ary Tree Postorder Traversal/README_EN.md

@@ -51,18 +51,20 @@ class Node:
         self.children = children
 """
 
+
 class Solution:
     def postorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
-            if root==None:
+            if root == None:
                 return res
             else:
                 for i in root.children:
                     PO(i)
                     res.append(i.val)
-        res=[]
+        res = []
         PO(root)
         res.append(root.val)
         return res

solution/0500-0599/0590.N-ary Tree Postorder Traversal/Solution.py

@@ -6,18 +6,20 @@ def __init__(self, val=None, children=None):
         self.children = children
 """
 
+
 class Solution:
     def postorder(self, root: 'Node') -> List[int]:
         if not root:
             return []
+
         def PO(root):
-            if root==None:
+            if root == None:
                 return res
             else:
                 for i in root.children:
                     PO(i)
                     res.append(i.val)
-        res=[]
+        res = []
         PO(root)
         res.append(root.val)
         return res

solution/0900-0999/0997.Find the Town Judge/README.md

@@ -85,12 +85,12 @@ class Solution:
             values.add(i[0])
             if i[1] in dic:
                 dic[i[1]].append(i[0])
-            else: dic[i[1]] = [i[0]]
+            else:
+                dic[i[1]] = [i[0]]
 
         for key, value in dic.items():
             if len(dic[key]) == n-1 and key not in values:
-                return key
-        return -1
+                return k
 ```
 
 ### **Java**

solution/0900-0999/0997.Find the Town Judge/README_EN.md

@@ -94,12 +94,12 @@ class Solution:
             values.add(i[0])
             if i[1] in dic:
                 dic[i[1]].append(i[0])
-            else: dic[i[1]] = [i[0]]
+            else:
+                dic[i[1]] = [i[0]]
 
         for key, value in dic.items():
             if len(dic[key]) == n-1 and key not in values:
-                return key
-        return -1
+                return k
 ```
 
 ### **Java**

solution/0900-0999/0997.Find the Town Judge/Solution.py

@@ -8,7 +8,8 @@ def findJudge(self, n: int, trust: List[List[int]]) -> int:
             values.add(i[0])
             if i[1] in dic:
                 dic[i[1]].append(i[0])
-            else: dic[i[1]] = [i[0]]
+            else:
+                dic[i[1]] = [i[0]]
 
         for key, value in dic.items():
             if len(dic[key]) == n-1 and key not in values:

solution/1700-1799/1791.Find Center of Star Graph/README.md

@@ -54,7 +54,7 @@
 ```python
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1]
+        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]
 ```
 
 ### **Java**

solution/1700-1799/1791.Find Center of Star Graph/README_EN.md

@@ -68,7 +68,7 @@
 ```python
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1]
+        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]
 ```
 
 ### **Java**

solution/1700-1799/1791.Find Center of Star Graph/Solution.py

@@ -1,3 +1,3 @@
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1] 
+        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]