LeetCode题解——permutations

Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:

[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].

using recursive，bactracking ，it's important to find the relationship of every iteration

class Solution {
public:
   /* vector<vector<int>> permute(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<vector<int>> ans;
        ans.push_back(nums);
        while(next_permutation(nums.begin(), nums.end())){
            ans.push_back(nums);
        }
        return ans;
    }*/
    vector<vector<int>> permute(vector<int>& nums){
        vector<vector<int>> res;
        permute(nums,res,0);
        return res;
    }
private: 
    void permute(vector<int>& nums, vector<vector<int>> & res, int begin){
        if(begin==nums.size()){
            res.push_back(nums);
            return;
        }
        for(int i = begin; i<nums.size(); i++){// each recursive get the permutations with the first number i
            swap(nums[i],nums[begin]);
            permute(nums,res,begin+1);
            swap(nums[i],nums[begin]);
        }
    }
};