第11周作业1(LeetCode31)

1. 题目描述

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

2. 解决思路

因为题目要求不能使用额外的空间，所以只能想到用交换更新的操作来达到排序的目的。具体分析就是：从后往前找，当找到第一对(i,j)满足nums[i] < nums[j]的就交换二者的位置，然后对剩下部分进行排序即可。

3. 完整代码

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

void nextPermutation(vector<int> &nums){
    int n = nums.size();
    for (int i = n-1; i >= 0; i--)
    {
        for (int j = n - 1; j > i; j--){
            if (nums[i] < nums[j])
            {
                swap(nums[i] , nums[j]);
                sort(nums.begin() + i + 1, nums.end());
                return;
            }
        }

    }
    sort(nums.begin(), nums.end());
}

int main(){
    vector<int> array;
    int len = array.size();
    int temp = 0;
    cout << "请输入一个若干整数的排列：\n" << endl;
    while (cin >> temp)
    {
        array.push_back(temp);
        if (cin.peek() == '\n')
        {
            break;
        }
    }
    nextPermutation(array);
    for (int i = 0; i < array.size(); i++)
    {
        cout << array[i] << " " ;
    }
}