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

Merge pull request #1167 from IcePigZDB/zijiII

Browse Source 
子集II cpp 代码formate
This commit is contained in:
程序员Carl
2022-04-06 14:12:43 +08:00
committed by GitHub
parent c4e11b24ed 907204559f
commit e790032c95
1 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -87,7 +87,7 @@ class Solution {
private: private:
vector<vector<int>> result; vector<vector<int>> result;
vector<int> path; vector<int> path;
void backtracking(vector<int>& nums, int startIndex, vector<bool>& used) { void backtracking(vector<int>& nums, int startIndex) {
result.push_back(path); result.push_back(path);
unordered_set<int> uset; unordered_set<int> uset;
for (int i = startIndex; i < nums.size(); i++) { for (int i = startIndex; i < nums.size(); i++) {
@ -96,7 +96,7 @@ private:
} }
uset.insert(nums[i]); uset.insert(nums[i]);
path.push_back(nums[i]); path.push_back(nums[i]);
backtracking(nums, i + 1, used); backtracking(nums, i + 1);
path.pop_back(); path.pop_back();
} }
} }
@ -105,9 +105,8 @@ public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) { vector<vector<int>> subsetsWithDup(vector<int>& nums) {
result.clear(); result.clear();
path.clear(); path.clear();
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end()); // 去重需要排序 sort(nums.begin(), nums.end()); // 去重需要排序
backtracking(nums, 0, used); backtracking(nums, 0);
return result; return result;
} }
}; };