leetcode——Next Permutation
来源:互联网 发布:淘宝的体检中心是什么 编辑:程序博客网 时间:2024/04/28 03:12
题目:
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
方法:
对于按照字典序进行求解,有一套方法:
1、依次将前后两个相邻数进行比较;找到后面大于前面的数的下标的最大值maxI;
2、从这个maxI开始(包括maxI),向后找到大于下标maxI-1上的数的下标的最大值maxL;
3、将L上的值跟maxI-1上的值互换,然后从maxI开始到末尾的子串进行颠倒即得到字典序的下一个序列。
AC代码:
public class Next_Permutation { private void reverse(int[] num, int start, int end) { while (start < end) { int i = num[start]; num[start] = num[end]; num[end] = i; start++; end--; } } public void nextPermutation(int[] num) { if (num == null || num.length == 0) return; int maxI = -1, maxL = -1; for (int i = 0; i < num.length - 1; i++) { if (num[i] < num[i + 1]) { maxI = i + 1; } } if (maxI == -1) { reverse(num, 0, num.length - 1); } else { for (int l = maxI; l < num.length; l++) { if (num[l] > num[maxI - 1]) { maxL = l; } } int i = num[maxI - 1]; num[maxI - 1] = num[maxL]; num[maxL] = i; reverse(num, maxI, num.length - 1); } }}
0 0
- LeetCode——Next Permutation
- leetcode——Next Permutation
- leetcode——Next Permutation
- leetcode 031 —— Next Permutation
- leetcode题集——next-permutation
- Leetcode——31. Next Permutation
- LeetCode算法题——Next Permutation
- leetcode——31——Next Permutation
- 【leetcode】Array—— Next Permutation(31)
- LeetCode刷题(C++)——Next Permutation(Medium)
- [LeetCode]—Next Permutation (全排列字典序)
- LeetCode: Next Permutation
- LeetCode Next Permutation
- LeetCode : Next Permutation
- [Leetcode] Next Permutation
- [LeetCode] Next Permutation
- [Leetcode] Next Permutation
- leetcode 88: Next Permutation
- 2015年SEO方向,难越三大项
- Android 命名规范 (提高代码可以读性)
- Go语言的接口和实现类初探(一)
- 清除运行对话框的历史记录
- JSTL中<c:forEach>标签中varStatus属性
- leetcode——Next Permutation
- 《编程之美》学习笔记——2.5寻找最大的K个数
- BZOJ1083 [SCOI2005]繁忙的都市(最小生成树)
- open course link 公开课资源链接
- VIM下,在文件及目录中查找字符串的方法 (vimgrep)
- 设置事务锁的超时时间
- mysql权限分配记录
- linux添加usb设备
- codeforces 509F Progress Monitoring (区间dp)