-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathPermutations
More file actions
56 lines (51 loc) · 1.43 KB
/
Permutations
File metadata and controls
56 lines (51 loc) · 1.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
class Solution {
public:
/**********************************************************
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> result;
result.push_back(vector<int>());
for(int i = 0;i<nums.size();i++)
{
vector<vector<int>> current;
for(auto it = result.begin();it!=result.end();it++)
{
for (int j = 0;j< (*it).size()+1;j++)
{
(*it).insert((*it).begin()+j,nums[i]);
current.push_back((*it));
(*it).erase((*it).begin()+j);
}
}
result = current;
}
return result;
}
*****************************************************/
vector<vector<int>> permute(vector<int>& nums) {
permuation(nums,0);
return result;
}
private:
void permuation(vector<int>&nums,int left)
{
if (left == nums.size()-1) {
result.push_back(nums);
return ;
}
else
{
for (int i = left; i <= nums.size()-1; i++) {
swap(nums, left, i);
permuation(nums, left + 1);
swap(nums, left, i);
}
}
}
void swap(vector<int>&nums, int i,int j)
{
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
vector<vector<int>> result;
};