LeetCode 0047 - Permutations II

Reck Zhang

发布于 2021-08-11 10:33:57

1480

发布于 2021-08-11 10:33:57

文章被收录于专栏：Reck Zhang

Permutations II

Desicription

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

Solution

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<vector<int>> res;
        sort(nums.begin(), nums.end());
        do
            res.push_back(nums);
        while(next_permutation(nums.begin(), nums.end()));
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-12，如有侵权请联系 cloudcommunity@tencent.com 删除

duplicates