algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

“不适用” -> “不使用”

Browse Source
This commit is contained in:
bqlin
2021-12-19 12:01:58 +08:00
parent 9e70fbc528
commit 96f70a46a4
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0090.子集II.md
View File

@ -115,7 +115,7 @@ public:
## 补充
本题也可以不适用used数组来去重，因为递归的时候下一个startIndex是i+1而不是0。
本题也可以不使用used数组来去重，因为递归的时候下一个startIndex是i+1而不是0。
如果要是全排列的话，每次要从0开始遍历，为了跳过已入栈的元素，需要使用used。