mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
Update0491.递增子序列,添加C#
This commit is contained in:
@ -614,6 +614,32 @@ 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>> FindSubsequences(int[] nums) {
|
||||
BackTracking(nums, 0);
|
||||
return res;
|
||||
}
|
||||
public void BackTracking(int[] nums, int start){
|
||||
if(path.Count >= 2){
|
||||
res.Add(new List<int>(path));
|
||||
}
|
||||
HashSet<int> hs = new HashSet<int>();
|
||||
for(int i = start; i < nums.Length; i++){
|
||||
if(path.Count > 0 && path[path.Count - 1] > nums[i] || hs.Contains(nums[i])){
|
||||
continue;
|
||||
}
|
||||
hs.Add(nums[i]);
|
||||
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">
|
||||
|
Reference in New Issue
Block a user