# #15 Permutations

Given a list of numbers, return all possible permutations.

##### Notice

You can assume that there is no duplicate numbers in the list.

Example

For nums = [1,2,3], the permutations are:

[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]

Mycode（AC ＝ 22ms）：

class Solution {
public:
/**
* @param nums: A list of integers.
* @return: A list of permutations.
*/
vector<vector<int> > permute(vector<int> nums) {
vector<vector<int>> ans;
if (nums.size() == 0) return ans;

vector<int> sofar;
unordered_set<int> visited;
permute(ans, sofar, nums, visited);
return ans;
}

void permute(vector<vector<int>>& ans,
vector<int>& sofar,
vector<int>& nums,
unordered_set<int>& visited)
{
if (sofar.size() == nums.size()) {
ans.push_back(sofar);
return;
}

for (int i = 0; i < nums.size(); i++) {
if (visited.find(nums[i]) == visited.end()) {
sofar.push_back(nums[i]);
visited.insert(nums[i]);

permute(ans, sofar, nums, visited);

sofar.pop_back();
visited.erase(nums[i]);
}
}
}
};


03-20 750

03-03 644

03-20 1.7万

03-03 553

03-20 1.5万

06-15 2437

12-01 739

05-29 6037

08-08 847

06-16 974