46_Permutations - a920604a/leetcode GitHub Wiki

class Solution {
public:
    void traverse(vector<int>& nums, vector<int>&path, vector<vector<int>> & ret){
        if(path.size() == nums.size()){
            ret.push_back(path);
            return;
        }
        
        for(int i=0;i<nums.size() ;++i){
            if(find(path.begin(), path.end(), nums[i])!=path.end()) continue;
            path.push_back(nums[i]);
            traverse(nums, path, ret);
            path.pop_back();
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> ret;
        vector<int> path;
        traverse(nums, path, ret);
        return ret;
    }
};

class Solution {
public:
    vector<vector<int>> ret;
    vector<bool> visited;
    void dfs(vector<int> & nums, vector<int> & path){
        if(path.size() == nums.size()){
            ret.push_back(path);
        }
        for(int i=0;i<nums.size();++i){
            if(visited[i]) continue;
            path.push_back(nums[i]);
            visited[i] = true;
            dfs(nums, path);
            path.pop_back();
            visited[i] = false;
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        vector<int> path;
        visited = vector<bool> (nums.size(), false) ;
        dfs(nums, path);
        return ret;      
    }
};

class Solution {
public:
    void traverse(vector<int>& nums,  vector<vector<int>> & ret, int s){
        if(s == nums.size()){
            ret.push_back(nums);
            return;
        }
        
        for(int i=s;i<nums.size() ;++i){
            swap(nums[i], nums[s]);
            traverse(nums, ret, s+1);
            swap(nums[i], nums[s]);
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        
        vector<vector<int>> ret;
        traverse(nums,ret, 0);
        return ret;
    }
};