LeetCode – Refresh – Permutations II

class Solution {
public:
    void getP(vector<vector<int> > &result, vector<int> &num, vector<int> current, vector<bool> rec) {
        if (num.size() == current.size()) {
            result.push_back(current);
            return;
        }
        for (int i = 0; i < num.size(); i++) {
            if (rec[i] || (i > 0 && num[i] == num[i-1] && rec[i-1])) continue;
            rec[i] = true;
            current.push_back(num[i]);
            getP(result, num, current, rec);
            rec[i] = false;
            current.pop_back();
        }
    }
    vector<vector<int> > permuteUnique(vector<int> &num) {
        vector<vector<int> > result;
        sort(num.begin(), num.end());
        getP(result, num, vector<int> (), vector<bool> (num.size(), false));
        return result;
    }
};