algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 20:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update0090.子集2，添加C#

Browse Source
This commit is contained in:
eeee0717
2023-12-19 09:32:06 +08:00
parent 5b5a05ada5
commit 7fdb7b1702
1 changed files with 25 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
problems/0090.子集II.md
View File

@ -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">