Permutations II

来源：互联网发布：淘宝虚拟网店不让开了编辑：程序博客网时间：2024/06/05 04:22

在LeetCode(46) Permutations的基础上删除重复的可行解。
仅仅添加了

 if(i >= 1 && nums[i] == nums[i - 1])                continue;

完整代码如下：

class Solution {public:    void dfs(vector<int> nums, vector<int> &oneResult, int depth, int &length, vector<vector<int>> &result) {        if(depth == length - 1) {            oneResult[depth] = nums[0];            result.push_back(oneResult);            return;        }        for(int i = 0; i < nums.size(); i++) {            if(i >= 1 && nums[i] == nums[i - 1])                continue;            oneResult[depth] = nums[i];            vector<int> numsTmp(nums);            numsTmp.erase(numsTmp.begin() + i);            dfs(numsTmp, oneResult, depth + 1, length, result);        }    }    vector<vector<int>> permuteUnique(vector<int>& nums) {        sort(nums.begin(), nums.end());        int length = nums.size();        vector<int> oneResult(length, 0);        vector<vector<int>> result;        int depth = 0;        dfs(nums, oneResult, depth, length, result);        return result;    }};

0 0