Next Permutation
来源:互联网 发布:在淘宝哪里看手机评估 编辑:程序博客网 时间:2024/05/17 02:42
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
Solution:
class Solution {public: void nextPermutation(vector<int>& nums) { int len = nums.size(); if(len <= 1) return ; int k = len - 1; while(k > 0 && nums[k] <= nums[k-1]) k--; if(!k) reverse(nums, 0, len - 1); else { int j = len - 1; while(j >= k && nums[j] <= nums[k-1]) j--; swap(nums[k-1], nums[j]); reverse(nums, k, len - 1); } } void reverse(vector<int> &nums, int left, int right) { int mid = (right - left) / 2; for(int i = 0; i <= mid; ++i) swap(nums[left+i], nums[right-i]); }};
0 0
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Next Permutation
- Android UI设计:Gallery
- Docker学习笔记(一):Dockerfile常用命令
- 决策树模型组合之随机森林与GBDT
- java多线程(九)阻塞队列
- Spring Security简介
- Next Permutation
- 原来微信支付可以这么简单!手把手搭建支付demo
- BLToolkit : Table-value functions
- xcode导入swift库出错
- Android studio中log日志工具的用法
- OpenStack常用命令之nova
- 使用maven编译zxing core源码
- hdu5375 Gray code
- hdoj 3466 【01背包】【DP】