[LeetCode]-全排列问题

问题描述

Given a collection of distinct integers, return all possible permutations.
Example:

• Input: [1,2,3]
• Output:
  [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]
  完整问题描述点击这里

解题思路

先求n-1的全排列，然后在前一个排列上插入最后一个数字，并求其全排列

完整代码

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        if (num.empty()) return vector<vector<int> >(1, vector<int>());
        vector<vector<int> > res;
        int first = num[0];
        num.erase(num.begin());
        vector<vector<int> > words = permute(num);
        for (auto &a : words) {
            for (int i = 0; i <= a.size(); ++i) {
                a.insert(a.begin() + i, first);
                res.push_back(a);
                a.erase(a.begin() + i);
            }
        }   
        return res;
    }
};