0046

class Solution {
	vector<vector<int>> permute(vector<int>& nums) {
    vector<vector<int>> result;

    if(nums.size() == 0) return result;

    result.push_back(vector<int>(1, nums[0]));

    for(size_t i = 1; i < nums.size(); ++i){
        vector<vector<int>> tmp;

        for(int j = 0; j <= i; ++j){
            for(auto p : result){
                p.insert(p.begin() + j, nums[i]);
                tmp.push_back(p);
            }
        }

        result = tmp;//std::move(tmp);
    }

    return result;
}