[LeetCode]Next Permutation

题目描述:(链接)

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

解题思路:

转载链接:http://www.cnblogs.com/easonliu/p/3632442.html

把升序的排列（当然，也可以实现为降序）作为当前排列开始，然后依次计算当前排列的下一个字典序排列。

对当前排列从后向前扫描，找到一对为升序的相邻元素，记为i和j（i < j）。如果不存在这样一对为升序的相邻元素，则所有排列均已找到，算法结束；否则，重新对当前排列从后向前扫描，找到第一个大于i的元素k，交换i和k，然后对从j开始到结束的子序列反转，则此时得到的新排列就为下一个字典序排列。这种方式实现得到的所有排列是按字典序有序的，这也是C++ STL算法next_permutation的思想。

链接：http://fisherlei.blogspot.com/2012/12/leetcode-next-permutation.html，具体过程见注释

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int i;
        int j;
        // From right to left, find the first item(PartitionNumber) which violate the increase trend
        for (i = nums.size() - 2; i >= 0; --i) {
            if (nums[i] < nums[i + 1]) { break; }
        }
        
        // From right to left, find the first item(ChangeNumber) which is larger than PartitionNumber
        for (j = nums.size() - 1; j >= i ; --j) {
            if (nums[j] > nums[i]) { break; }
        }
        
        // swap PartitionNumber and ChangeNumber
        if (i >= 0) {
            swap(nums[i], nums[j]);
        }
        
        // reverse all after PartitionNumber index
        reverse(nums.begin() + i + 1, nums.end());
    }
};