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

“树支” -> ”树枝“

Browse Source
This commit is contained in:
bqlin
2021-12-19 11:54:22 +08:00
parent 440f94447a
commit 9e70fbc528
5 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -55,7 +55,7 @@ private:
void backtracking(vector<int>& nums, int startIndex, vector<bool>& used) {
result.push_back(path);
for (int i = startIndex; i < nums.size(); i++) {
// used[i - 1] == true，说明同一树支candidates[i - 1]使用过
// used[i - 1] == true，说明同一树枝candidates[i - 1]使用过
// used[i - 1] == false，说明同一树层candidates[i - 1]使用过
// 而我们要对同一树层使用过的元素进行跳过
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) {