leetcode 日经贴，Cpp code -Permutations II

最新推荐文章于 2022-05-09 19:34:36 发布

bachelorchen

最新推荐文章于 2022-05-09 19:34:36 发布

阅读量294

点赞数

分类专栏：算法 leetcode Cpp

本文链接：https://blog.csdn.net/bachelorchen/article/details/45535739

版权

算法同时被 3 个专栏收录

183 篇文章 0 订阅

订阅专栏

leetcode

173 篇文章 0 订阅

订阅专栏

Cpp

152 篇文章 0 订阅

订阅专栏

Permutations II

class Solution {
public:
    bool next_permutation(vector<int> &nums) {
        int n = nums.size();
        if (n <= 1) {
            return false;
        }
        int ed = n - 1;
        while (ed > 0 && nums[ed - 1] >= nums[ed]) {
            --ed;
        }
        int st = ed;
        if (ed > 0) {
            for (int i = n - 1; i >= 0; --i) {
                if (nums[i] > nums[ed - 1]) {
                    ed = i; 
                    break;
                }
            }
            swap(nums[ed], nums[st - 1]);
        }
        ed = n - 1;
        bool ret = st > 0;
        while (st < ed) {
            swap(nums[st++], nums[ed--]);
        }
        return ret;
    }
    
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int> >ret;
        ret.push_back(nums);
        while (next_permutation(nums)) {
            ret.push_back(nums);
        }
        return ret;
    }
};