zoukankan      html  css  js  c++  java
  • 47.Permutations II

    public:
        vector<vector<int>> permuteUnique(vector<int>& nums) {
            vector<vector<int>> res;
            vector<int> out, visited(nums.size(), 0);
            sort(nums.begin(), nums.end());
            permuteUniqueDFS(nums, 0, visited, out, res);
            return res;
        }
        void permuteUniqueDFS(vector<int>& nums, int level, vector<int>& visited, vector<int>& out, vector<vector<int>>& res) {
            if (level >= nums.size()) {res.push_back(out); return;}
            for (int i = 0; i < nums.size(); ++i) {
                if (visited[i] == 1) continue;
                if (i > 0 && nums[i] == nums[i - 1] && visited[i - 1] == 0) continue;
                visited[i] = 1;
                out.push_back(nums[i]);
                permuteUniqueDFS(nums, level + 1, visited, out, res);
                out.pop_back();
                visited[i] = 0;
            }
        }
    };
    
  • 相关阅读:
    Evensgn 的债务
    Passward
    拯救莫莉斯
    文艺平衡树
    Fliptile 翻格子游戏
    Making the Grade (bzoj1592)
    紧急疏散evacuate
    Password
    [NOIP2015]斗地主
    运输问题1
  • 原文地址:https://www.cnblogs.com/smallredness/p/10675162.html
Copyright © 2011-2022 走看看