LeetCode OJ Permutations II

来源:互联网 发布:微信淘口令淘宝打不开 编辑:程序博客网 时间:2024/04/27 22:36
class Solution {public:    vector<vector<int> > permuteUnique(vector<int> &num) {        vector<int> n = num;        sort(n.begin(), n.end());        vector<int> ori = n;        vector<vector<int> > ans;        while (1) {            ans.push_back(n);            next_permutation(n.begin(), n.end());            if (n == ori) break;        }        return ans;    }};

0 0