[LeetCode]Next Permutation
来源:互联网 发布:java图书管理系统教程 编辑:程序博客网 时间:2024/05/29 16:48
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
刚开始没看懂,后面查看网上资料才搞懂,就是转化为按照字典顺序排列的后面的一个排列
如:15467543应该为15473456
class Solution {public: void nextPermutation(vector<int> &num) { int i, j;i = num.size() - 2;j = num.size() - 1;//从后往前找,先找到不满足非降序的第一个数;while(i >= 0 && num[i] >= num[i + 1]){i--;}//从后往前找,找到大于上面找到的非降序的第一个数while(j >= 0 && num[j] <= num[i]){j--;}if(i < j){int temp;temp = num[j];num[j] = num[i];num[i] = temp;//swap(num[i], num[j]);sort(num.begin() + i + 1, num.end());}else{reverse(num.begin(), num.end());} }};
1 0
- LeetCode: Next Permutation
- LeetCode Next Permutation
- LeetCode : Next Permutation
- [Leetcode] Next Permutation
- [LeetCode] Next Permutation
- [Leetcode] Next Permutation
- leetcode 88: Next Permutation
- [LeetCode]Next Permutation
- LeetCode-Next Permutation
- [leetcode]Next Permutation
- LeetCode - Next Permutation
- LeetCode 31: Next Permutation
- 【leetcode】Next Permutation
- LeetCode题解:Next Permutation
- 【LeetCode】Next Permutation
- [LeetCode] Next Permutation
- LeetCode Next Permutation
- leetCode | Next Permutation
- loj 1412(树上最长直径的应用)
- loj 1377 (bfs)
- loj 1426(dfs + bfs)
- 求阶乘的位数
- java大数取模
- [LeetCode]Next Permutation
- loj1011 状态压缩
- loj 1030概率dp
- loj 1032 数位dp
- loj 1257 (求树上每一个点到树上另一个点的最长距离)
- loj 1337
- loj 1357(树形dp)
- loj 1210 (求最少的加边数使得图变成强连通)
- loj 1406(状态压缩)