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;
}
};
LeetCode OJ Permutations II
最新推荐文章于 2024-10-06 13:05:10 发布