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, res, 0);
        return res;
    }

    void permuteRecursive(vector<int>& nums, vector<vector<int>>& res, int begin) {
        if (begin >= nums.size()) {
            res.push_back(nums);
            return;
        }
        // permute num[begin..end]
        // invariant: num[0..begin-1] have been fixed/permuted
        for (int i = begin; i < nums.size(); i++) {
            swap(nums[begin], nums[i]);
            permuteRecursive(nums, res, begin + 1);
            // reset
            swap(nums[begin], nums[i]);
        }
    }
};