From 2a61ec45e6366c35189ead2b08914104c1df672e Mon Sep 17 00:00:00 2001
From: Logen <47022821+Logenleedev@users.noreply.github.com>
Date: Mon, 29 May 2023 17:38:31 -0500
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E5=A4=8D=E6=9D=82=E5=BA=A6?=
 =?UTF-8?q?=E5=88=86=E6=9E=90?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0047.全排列II.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/problems/0047.全排列II.md b/problems/0047.全排列II.md
index b1908fb4..a1036b37 100644
--- a/problems/0047.全排列II.md
+++ b/problems/0047.全排列II.md
@@ -98,6 +98,8 @@ public:
     }
 };
 
+// 时间复杂度: 最差情况所有元素都是唯一的。复杂度和全排列1都是 O(n! * n) 对于 n 个元素一共有 n! 中排列方案。而对于每一个答案，我们需要 O(n) 去复制最终放到 result 数组
+// 空间复杂度: O(n) 回溯树的深度取决于我们有多少个元素
 ```
 
 ## 拓展