Update 0063.不同路径2，添加C#

problems/0063.不同路径II.md

@@ -734,6 +734,30 @@ object Solution {
   }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public int UniquePathsWithObstacles(int[][] obstacleGrid)
+    {
+        int m = obstacleGrid.Length;
+        int n = obstacleGrid[0].Length;
+        int[,] dp = new int[m, n];
+        if (obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1) return 0;
+        for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) dp[i, 0] = 1;
+        for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++) dp[0, j] = 1;
+        for (int i = 1; i < m; i++)
+        {
+            for (int j = 1; j < n; j++)
+            {
+                if (obstacleGrid[i][j] == 1) continue;
+                dp[i, j] = dp[i - 1, j] + dp[i, j - 1];
+            }
+        }
+        return dp[m - 1, n - 1];
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">