zoukankan      html  css  js  c++  java
  • LeetCode 31. Next Permutation【Medium】

    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 and use only constant 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

    class Solution {
        public void nextPermutation(int[] nums) {
            int i = nums.length - 2;
            while(i >= 0 && nums[i+1] <= nums[i]) i--;
            if(i >= 0){
                int j = nums.length - 1;
                while(j >= 0 && nums[j] <= nums[i]) j--;
                swap(nums, i , j);
            }
            reverse(nums , i+1);
        }
        private void reverse(int[] nums, int start){
            int i = start, j = nums.length - 1;
            while(i < j){
                swap(nums, i, j);
                i++;
                j--;
            }
        }
        private void swap(int[] nums, int i, int j){
            int t = nums[i];
            nums[i] = nums[j];
            nums[j] = t;
        }
    }
    
  • 相关阅读:
    css3
    jquery常用的几种配置
    1808第一周笔记
    webpack打包的用法
    模块的使用及几类方式
    node的规范(common.js)
    模块化开发
    传统开发模式的缺点
    创建百度地图
    离线缓存总结
  • 原文地址:https://www.cnblogs.com/Roni-i/p/11068334.html
Copyright © 2011-2022 走看看