Next Permutation

[leetcode]Next Permutation

链接：https://leetcode.com/problems/next-permutation/description/

Question

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 and use only constant 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

Solution

class Solution {
public:
  #define inf 0x3fffffff
  void nextPermutation(vector<int>& nums) {
    int index = 0;
    for (int i = nums.size()-1; i >= 1; i--) {
      if (nums[i-1] < nums[i]) {
        index = i;
        break;
      }
    }
    // print(index);
    int bigger_num_index = 0;
    for (int i = nums.size()-1; i >= index; i--)
      if (nums[i] > nums[index-1]) {
        bigger_num_index = i;
        break;
      }
    // print(bigger_num_index);
    if (index >= 1) {
      swap(nums[bigger_num_index], nums[index-1]);
      sort(nums.begin()+index, nums.end());
    } else {
      sort(nums.begin(), nums.end());
    }
  }
};

思路：从后面往前找，如果升序则一直往前直到不是升序为止如 1 5 4 3 2 3 2 4 3 1则找到倒序第一个2，将2与后面4 3 1中的第一个大于2的值即3交换，变成 1 5 4 3 2 3 3 4 2 1，将3后面的进行从小到大排序，即1 5 4 3 2 3 3 1 2 4，完毕。