代码：
void per(vector<int> nums,int start,vector<vector<int> > &result){
if(start==nums.size()-1){
result.push_back(nums);
}
else{
for(int i=start;i<nums.size();i++){
swap(nums[start],nums[i]);
per(nums,start+1,result);
swap(nums[start],nums[i]);
}
}
}
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;
if(nums.size()==0){
result.push_back(nums);
return result;
}
per(nums,0,result);
return result;
}
};
lintcode截图：
原文：http://www.cnblogs.com/aly15109725486/p/7235678.html