Leetcode-Permutation ll（深搜）

来源：互联网发布：罗技g303编程编辑：程序博客网时间：2024/06/08 18:36

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:

[  [1,1,2],  [1,2,1],  [2,1,1]]

class Solution {public:    vector<vector<int>> ans;    vector<int> tmp;    bool canSwap(int i, int j, vector<int>& nums)    {        for(int k=i; k<j; k++)            if(nums[k] == nums[j])                return false;        return true;    }    void dfs(int depth, vector<int>& nums)    {        if(depth >= nums.size()-1)        {            tmp.clear();            for(int i=0; i<nums.size(); i++)                tmp.push_back(nums[i]);            ans.push_back(tmp);            return;        }        for(int i=depth; i<nums.size(); i++)        {            if(canSwap(depth, i, nums))            {                swap(nums[depth], nums[i]);                dfs(depth+1, nums);                swap(nums[depth], nums[i]);            }        }    }    vector<vector<int>> permuteUnique(vector<int>& nums)     {        dfs(0, nums);        return ans;    }};

类似于Permutation，只是多加了一个判断条件

阅读全文

0 0