Commit b957332

authored

Add C++ solution to 047

1 parent 924d004 commit b957332Copy full SHA for b957332

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ vector<vector<int>> permuteUnique(vector<int>& nums) {`
	`4`	`+ if (nums.size() <= 0) return{};`
	`5`	`+`
	`6`	`+ sort(nums.begin(), nums.end());`
	`7`	`+`
	`8`	`+ vector<vector<int>> res;`
	`9`	`+ vector<bool> used;`
	`10`	`+ vector<int> curr;`
	`11`	`+`
	`12`	`+ for (auto item : nums)`
	`13`	`+ {`
	`14`	`+ used.push_back(false);`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ dfs(res, nums, curr, used, 0);`
	`18`	`+ return res;`
	`19`	`+ }`
	`20`	`+`
	`21`	`+ void dfs(vector<vector<int>>& res, vector<int>& nums, vector<int> curr, vector<bool> used, int depth)`
	`22`	`+ {`
	`23`	`+ if (depth >= nums.size())`
	`24`	`+ {`
	`25`	`+ res.emplace_back(curr);`
	`26`	`+ return;`
	`27`	`+ }`
	`28`	`+`
	`29`	`+ for (int i = 0; i < nums.size(); i++)`
	`30`	`+ {`
	`31`	`+ if (used[i]) continue;`
	`32`	`+ if (i > 0 && nums[i] == nums[i - 1] && !used[i-1]) continue;`
	`33`	`+`
	`34`	`+ used[i] = true;`
	`35`	`+ curr.emplace_back(nums[i]);`
	`36`	`+ dfs(res, nums, curr, used, depth + 1);`
	`37`	`+ curr.pop_back();`
	`38`	`+ used[i] = false;`
	`39`	`+ }`
	`40`	`+ }`
	`41`	`+};`

Comments

(0)