LEETCODE: Next Permutation

最新推荐文章于 2024-11-10 21:43:58 发布

停止更新+1

最新推荐文章于 2024-11-10 21:43:58 发布

阅读量262

点赞数

文章标签： LEETCODE 算法

本文链接：https://blog.csdn.net/anyicheng2015/article/details/41945827

版权

LEETCODE 专栏收录该内容

153 篇文章 0 订阅

订阅专栏

本文介绍了一个算法问题——如何在原地将一组整数重新排列为字典序中下一个更大的排列。如果无法实现这样的排列，则将其变为最小的排列（升序）。文章提供了一个C++示例代码实现，展示了寻找合适元素进行交换并翻转子数组的过程。

摘要由CSDN通过智能技术生成

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).

The replacement must be in-place, do not allocate extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        int pos = num.size() - 1;
        while(pos > 0) {
            if(num[pos - 1] < num[pos]) break;
            pos --;
        }
        
        int large = num.size() - 1;
        while(large > 0) {
            if(num[large] > num[pos]) break;
            large --;
        }
        
        if(pos > 0) {
            pos --;
            int large = num.size() - 1;
            while(large > 0) {
            if(num[large] > num[pos]) break;
                large --;
            }
            swap(num[large], num[pos]);
            reverse(num.begin() + pos + 1, num.end());
        }
        else {
            reverse(num.begin(), num.end());
        }
    }
};