leetcode - 31.Next Permutation
2017-03-02 19:56
399 查看
Next Permutation
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:
public void nextPermutation(int[] num) { if (num == null || num.length < 2) { return; } int length = num.length; int index = length - 1; while (index > 0) { if (num[index - 1] < num[index]) break; index--; } if (index == 0) { reverseSort(num, 0, length - 1); } else { int val = num[index - 1]; int j = length - 1; while (j >= index) { if (num[j] > val) break; j--; } swap(num, j, index - 1); reverseSort(num, index, length - 1); } } public void swap(int[] num, int i, int j) { int temp = num[i]; num[i] = num[j]; num[j] = temp; } public void reverseSort(int[] num, int start, int end) { if (start > end) return; for (int i = start; i <= (end + start) / 2; i++) swap(num, i, start + end - i); }
相关文章推荐
- Leetcode题解(31)
- [leetcode] 31. Next Permutation
- LeetCode-31-Next Permutation 贪心,排序
- LeetCode - 31. Next Permutation
- Leetcode 31. Next Permutation (Medium) (cpp)
- leetcode(31) - Next Permutation
- LeetCode (31) Divide two integers (不使用 *, /, mod 求两个数相除结果)
- LeetCode 31 Next Permutation(下一个排列)
- leetcode(31).111. Minimum Depth of Binary Tree
- leetcode 31. Next Permutation
- leetcode-31. Next Permutation
- leetcode 31 - next permutation
- leetcode 题解代码整理 31-35题
- leetcode 31. Next Permutation
- Leetcode-31. Next Permutation
- LEETCODE 31. Next Permutation
- Leetcode: 31. Next Permutation
- [leetcode] 31.Next Permutation
- LeetCode 31 Next Permutation 寻找一个数字序列的比他大的最小序列
- LeetCode31. Next Permutation最清晰的解法