diff --git a/problems/0332.重新安排行程.md b/problems/0332.重新安排行程.md
index 9bd5df7a..95e7d3ed 100644
--- a/problems/0332.重新安排行程.md
+++ b/problems/0332.重新安排行程.md
@@ -380,7 +380,33 @@ class Solution:
         backtracking("JFK")
         return path
 ```
+	
+python  - 使用used数组 - 神似之前几题写法
 
+```python	
+class Solution:
+    def findItinerary(self, tickets: List[List[str]]) -> List[str]:
+        global used,path,results
+        used = [0]*len(tickets)
+        path = ['JFK']
+        results = []
+        tickets.sort() # 先排序，这样一旦找到第一个可行路径，一定是字母排序最小的
+        self.backtracking(tickets,'JFK')
+        return results[0]
+    def backtracking(self,tickets,cur):
+        if sum(used) == len(tickets):
+            results.append(path[:])
+            return True # 只要找到就返回
+        for i in range(len(tickets)):
+            if tickets[i][0]==cur and used[i]==0:
+                used[i]=1
+                path.append(tickets[i][1])
+                state = self.backtracking(tickets,tickets[i][1])
+                path.pop()
+                used[i]=0
+                if state: return True # 只要找到就返回，不继续搜索了
+```
+	
 ### GO
 ```go
 type pair struct {