leetcode 46|47. Permutations 1|2

46. Permutations

Given a collection of distinct numbers, return all possible permutations.

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

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

backtracking!

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> ret;
        vector<int> tmp;
        helper(ret, tmp, nums);
        return ret;
    }
    void helper(vector<vector<int>> &ret, vector<int> &tmp, vector<int>& nums)
    {
        if (tmp.size() == nums.size())
        {
            ret.push_back(tmp);
            return;
        }
        for (int i = 0; i < nums.size(); i++)
        {
            if (mybit[i])
                continue;
            mybit.set(i);
            tmp.push_back(nums[i]);
            helper(ret, tmp, nums);
            tmp.pop_back();
            mybit.reset(i);
        }
    }
private:
    bitset<50> mybit;
};

47. Permutations II

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]
]

backtracking! 和前一个题比起来就是每进入一层加一个hash，同一层一样的数往下层走一次就行了。

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<vector<int>> ret;
        vector<int> tmp;
        helper(ret, tmp, nums);
        return ret;
    }
    void helper(vector<vector<int>> &ret, vector<int> &tmp, vector<int>& nums)
    {
        if (tmp.size() == nums.size())
        {
            ret.push_back(tmp);
            return;
        }
        set<int> hash; //去重
        for (int i = 0; i < nums.size(); i++)
        {
            if (mybit[i] || hash.find(nums[i]) != hash.end())
                continue;
            mybit.set(i);
            tmp.push_back(nums[i]);
            hash.insert(nums[i]);
            helper(ret, tmp, nums);
            tmp.pop_back();
            mybit.reset(i);
        }
    }
private:
    bitset<50> mybit;
};