From 60624686a894dadcfefb79cd38e40f0308217f93 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Fri, 28 May 2021 00:09:28 +0200
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200491.=E9=80=92=E5=A2=9E?=
 =?UTF-8?q?=E5=AD=90=E5=BA=8F=E5=88=97=20python3=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0491.递增子序列 python3版本
---
 problems/0491.递增子序列.md | 23 ++++++++++++++++++++++-
 1 file changed, 22 insertions(+), 1 deletion(-)

diff --git a/problems/0491.递增子序列.md b/problems/0491.递增子序列.md
index 691f7aef..5538a2c9 100644
--- a/problems/0491.递增子序列.md
+++ b/problems/0491.递增子序列.md
@@ -229,7 +229,28 @@ class Solution {
 
 
 Python：
-
+```python3
+class Solution:
+    def findSubsequences(self, nums: List[int]) -> List[List[int]]:
+        res = []
+        path = []
+        def backtrack(nums,startIndex):
+            repeat = []  #这里使用数组来进行去重操作
+            if len(path) >=2:
+                res.append(path[:])  #注意这里不要加return，要取树上的节点
+            for i in range(startIndex,len(nums)):
+                if nums[i] in repeat:
+                    continue
+                if len(path) >= 1:
+                    if nums[i] < path[-1]:
+                        continue
+                repeat.append(nums[i])  #记录这个元素在本层用过了，本层后面不能再用了
+                path.append(nums[i])
+                backtrack(nums,i+1)
+                path.pop()
+        backtrack(nums,0)
+        return res
+```
 
 Go：