Leecode#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

Difficulty:Medium

这题比较难懂,简单的说是输出输入排列的下个字典排序。

123 132 213 231 312 321

以上是字典排序,体会一下吧。具体实现不难,可以参考:http://www.shangxueba.com/jingyan/1816116.html。

void nextPermutation(vector<int>& nums) {
        int len = nums.size();
        int i = len-1,j=len-1;
        int temp;
        if(len==1||len==0)
            return;
        if(len==2)
        {
           temp = nums[0];
           nums[0]=nums[1];
           nums[1]=temp;
           return;
        }
        while(i>=1)
        {
            if(nums[i]<=nums[i-1])
                i--;
            else
                break;
        }
        i--;
        if(i==-1)
        {
            sort(nums.begin(),nums.end());
            return;
        }
        while(j>=0)
        {
            if(nums[j]<=nums[i])
                j--;
            else
                break;

        }
        temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
        for(int k =i+1;k<=((len-1-i-1)/2+i+1);k++)
        {
            temp = nums[k];
            nums[k] = nums[len-1-(k-(i+1))];
            nums[len-1-(k-(i+1))] = temp;
        }
        return;
    }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值