LeetCodeSrc/LeetCode#38.cc at master · Whosemario/LeetCodeSrc · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class Solution {
private:
    void dfs(int ind, vector<int>& num, vector<int>& col,
        vector<int>& tmp, vector<vector<int> >& res){
            if(ind==num.size()){
                vector<int> tt = tmp;
                res.push_back(tt);
            }

            int flag = 0;
            int pre;
            for(int i=0;i<num.size();i++)
                if(col[i]==0 && (flag==0 || num[i]!=pre)){
                    flag = 1;
                    col[i]=1;
                    tmp[ind]=num[i];
                    pre = num[i];
                    dfs(ind+1,num,col,tmp,res);
                    col[i]=0;
                }
            return ;
        }

public:
    vector<vector<int> > permuteUnique(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > ret;
        if(num.size()==0) return ret;
        vector<int> col(num.size());
        vector<int> tmp(num.size());

        sort(num.begin(),num.end());

        for(int i=0;i<num.size();i++) col[i]=0;

        dfs(0,num,col,tmp,ret);

        return ret;
    }
};