【leetcode】46. Permutations

Given a collection of distinct 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],
[3,2,1]
]

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> res;
        permuteRecursive(nums,0,res);
        return res;
    }

    void permuteRecursive(vector<int>& nums,int begin, vector<vector<int>> &result){
        if(begin == nums.size()){
            result.push_back(nums);
            return;
        }

        for(int i=begin;i<nums.size();i++){
            swap(nums[i],nums[begin]);
            permuteRecursive(nums,begin+1,result);
            swap(nums[i],nums[begin]);
        }
    }
};