leetcode_31. Next Permutation
来源:互联网 发布:网络创意 卖给 编辑:程序博客网 时间:2024/05/18 02:43
https://leetcode.com/problems/next-permutation/#/description
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
Subscribe to see which companies asked this question.
思路:看几组例子就可以知道了~~
1 2 3 5 4 ------> 1 2 4 3 5
1 2 5 3 4 ------> 1 3 2 4 5
1 3 2 5 4 ------> 1 3 4 2 5
所以,规律就是从后面往前找,找到一个nums[i-1]<nums[i],然后再去后面找一个最小的比nums[i-1]大的,再对i~end的位置进行排序~~详情见代码
class Solution {public: void nextPermutation(vector<int>& nums) { int length = nums.size(); int pos=-1; for(int i=length-1;i>0;i--) { if(nums[i-1]<nums[i]) { pos=i-1; break; } } if(pos==-1) { sort(nums.begin(),nums.end()); return; } int Min=1<<30; int p=0; for(int i=pos+1;i<length;i++) { if(Min>nums[i]&&nums[i]>nums[pos]) { Min=nums[i]; p=i; } } int t=nums[p]; nums[p]=nums[pos]; nums[pos]=t; sort(nums.begin()+pos+1,nums.end()); }};
- LeetCode_31---Next Permutation
- leetcode_31. 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
- 4765: 普通计算姬
- Collections类中的实用工具
- poj3461 (裸kmp)kmp模板
- 简单Java类实训二
- ubuntu下安装程序的三种方法以及卸载命令
- leetcode_31. Next Permutation
- Sapera帮助文档
- Spring-5,配置bean
- ConcurrentHashMap 分段锁
- [IOS APP]【现代流行唱法】零基础入门学唱歌
- android面试java算法题【安卓进化四】
- 光场相机了解
- android app性能分析工具
- 数据库备份