Commit fc3c9ad

authored

Permutations CPP

排列数,模板题

1 parent 2a95426 commit fc3c9adCopy full SHA for fc3c9ad

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

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

Comments

(0)