首页 > 代码库 > Next Permutation

Next Permutation

2024-07-23 12:19:51   220人阅读

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 reverse(int []num,int i,int j)
    {
        for(;i<j;i++,j--)
        {
            int p=num[i];
            num[i]=num[j];
            num[j]=p;
        }
    }
    public void nextPermutation(int[] num) {
        if(num==null||num.length<=1)
        {
            return ;
        }
        int i,j;
        for(i=num.length-2;i>=0;i--)
        {
            if(num[i+1]<=num[i])
            {
                continue;
            }
            for(j=num.length-1;j>i;j--)
            {
                if(num[j]>num[i])
                {
                    int p=num[i];
                    num[i]=num[j];
                    num[j]=p;
                    reverse(num,i+1,num.length-1);
                    return;
                }
            }
        }
        reverse(num,0,num.length-1);
    }
}



Next Permutation


联系
我们