sunnylinner的博客

自从习惯了云笔记,写博客的动力都没了呢_(:з」∠)_,希望我继续更新的请留言~...

31. 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

public class Solution {
    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;
        A[i] = A[i] + A[j];
        A[j] = A[i] - A[j];
        A[i] = A[i] - A[j];
    }

    public void reverse(int[] A, int i, int j) {
        while(i < j) swap(A, i++, j--);
    }
}
// 题目思路
// 先右边找第一个违反递减规则的数,这个数后面就是递减的了,该数为目标数a
// 再从右边找第一个比目标数a大的数,该数为目标数b
// a b互换,中间的递减序列分别互换,得结果
// 思路相当棒啊~~~~
阅读更多
版权声明:本文为博主原创文章,转载须注明出处,谢谢~ https://blog.csdn.net/sunnylinner/article/details/52382620
文章标签: java LeetCode
个人分类: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

31. Next Permutation

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭