数组全排列

递归解决问题，每次选取1个数，其余数递归解决。

#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
    vector <int> lineres;
    vector<vector<int>> result;
    int number = 0;
    vector<vector<int>> permute(vector<int>& nums) {
        number = (int)nums.size();
        helper(nums);
        return result;
    }
    void helper (vector<int> nums){
        vector<int> tmp;
        vector<int>::iterator k;
        for (int i = 0; i < nums.size(); ++i) {
            lineres.push_back(nums[i]);
            tmp = nums;
            k = tmp.begin() + i;
            tmp.erase(k);
            helper(tmp);

        }
        if(lineres.size()==number)
            result.push_back(lineres);
        lineres.pop_back();
    }
};