lintcode-15-全排列

全排列

code

class Solution {
public:
/**
* @param nums: A list of integers.
* @return: A list of permutations.
*/
vector<vector<int> > permute(vector<int> nums) {
// write your code here
vector<vector<int> > result;
int size = nums.size();
if(size == 0) {
result.push_back(nums);
return result;
}

permute(nums, 0, size, result);

return result;
}

void permute(vector<int> &nums, int begin, int end, vector<vector<int> > &result) {
if(begin == end)
result.push_back(nums);
else {
for(int i=begin; i<end; i++) {
int temp = nums[i];
nums[i] = nums[begin];
nums[begin] = temp;

permute(nums, begin+1, end, result);

temp = nums[i];
nums[i] = nums[begin];
nums[begin] = temp;
}
}
}
};