[leetcode] Permutations

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

思路：dfs

代码：

class Solution {
private:
    int n;
    vector<bool> flag;
    vector<vector<int>> res;
public:
    vector<vector<int> > permute(vector<int> &num) {
        n=num.size();
        res.clear();
        flag.resize(n,false);
        if(n==0) return res;
        vector<int> temp(n,0);
        dfs(temp,num,0);
        return res;
    }
    void dfs(vector<int> temp, vector<int> &num, int step){
        if(step==n){
            res.push_back(temp);
            return;
        }
        for(int i=0;i<n;i++){
            if(flag[i]==false){
                temp[step]=num[i];
                flag[i]=true;
                dfs(temp,num,step+1);
                flag[i]=false;
            }
        }
    }
    
};