Merge pull request #2369 from eeee0717/master

Update0078.子集，添加C#

problems/0078.子集.md

@@ -443,6 +443,27 @@ object Solution {
   }
 }
 ```
+### C#
+```csharp
+public class Solution {
+    public IList<IList<int>> res = new List<IList<int>>();
+    public IList<int> path = new List<int>();
+    public IList<IList<int>> Subsets(int[] nums) {
+        BackTracking(nums, 0);
+        return res;
+    }
+    public void BackTracking(int[] nums, int start){
+        res.Add(new List<int>(path));
+        if(start > nums.Length) return;
+        for (int i = start; i < nums.Length; i++)
+        {
+            path.Add(nums[i]);
+            BackTracking(nums, i + 1);
+            path.RemoveAt(path.Count - 1);
+        }
+    }
+}
+```
 
 
 <p align="center">

problems/0090.子集II.md

@@ -640,6 +640,31 @@ object Solution {
   }
 }
 ```
+### C#
+```c#
+public class Solution
+{
+    public IList<IList<int>> res = new List<IList<int>>();
+    public IList<int> path = new List<int>();
+    public IList<IList<int>> SubsetsWithDup(int[] nums)
+    {
+        Array.Sort(nums);
+        BackTracking(nums, 0);
+        return res;
+    }
+    public void BackTracking(int[] nums, int start)
+    {
+        res.Add(new List<int>(path));
+        for (int i = start; i < nums.Length; i++)
+        {
+            if (i > start && nums[i] == nums[i - 1]) continue;
+            path.Add(nums[i]);
+            BackTracking(nums, i + 1);
+            path.RemoveAt(path.Count - 1);
+        }
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">