lc46-Permutations

發表於   |   分類於   |   0 comments   |   
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
class Solution {
private:
    vector<vector<int>> ans;
    vector<int> marked;
    vector<int> sol;
public:
    vector<vector<int>> permute(vector<int>& nums) {
       for (int i = 0; i < nums.size(); i++) 
            marked.push_back(0);
        permute_(nums);
        return ans;
    }
    
    
    void permute_(vector<int>& nums) {
        bool flag = false;
        int i;
        for (i = 0; i < nums.size(); i++) {
            if(!marked[i]) {
                sol.push_back(nums[i]);
                marked[i] = 1;
                flag = true;
            }
            else 
                continue;
            permute_(nums);
           
            sol.pop_back();
            marked[i] = 0;
        }
        if (!flag) {
             ans.push_back(sol);
            return;
        }
    }
};