From f9342095c9b7d79d8c6debc165a193ddc3e39169 Mon Sep 17 00:00:00 2001
From: eeee0717 <chentao020717Work@outlook.com>
Date: Wed, 20 Dec 2023 09:26:14 +0800
Subject: [PATCH] =?UTF-8?q?Update0491.=E9=80=92=E5=A2=9E=E5=AD=90=E5=BA=8F?=
 =?UTF-8?q?=E5=88=97=EF=BC=8C=E6=B7=BB=E5=8A=A0C#?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0491.递增子序列.md | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/problems/0491.递增子序列.md b/problems/0491.递增子序列.md
index eb0be005..1aa69a36 100644
--- a/problems/0491.递增子序列.md
+++ b/problems/0491.递增子序列.md
@@ -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">