题目

字典排序问题。。。自己想估计要想破脑袋了。。。有时间再总结一下吧

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

public void nextPermutation(int[] A) {    if(A == null || A.length <= 1) return;    int i = A.length - 2;    while(i >= 0 && A[i] >= A[i + 1]) i--; // Find 1st id i that breaks descending order    if(i >= 0) {                           // If not entirely descending        int j = A.length - 1;              // Start from the end        while(A[j] <= A[i]) j--;           // Find rightmost first larger id j        swap(A, i, j);                     // Switch i and j    }    reverse(A, i + 1, A.length - 1);       // Reverse the descending sequence}public void swap(int[] A, int i, int j) {    int tmp = A[i];    A[i] = A[j];    A[j] = tmp;}public void reverse(int[] A, int i, int j) {    while(i < j) swap(A, i++, j--);}