首页 > 代码库 > LeetCode OJ - Next Permutation
LeetCode OJ - 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
解题思路：
代码：
1 class Solution { 2 public: 3 void nextPermutation(vector<int> &num) { 4 if (num.size() == 1) return; 5 6 int reversed, bigger; 7 for (reversed = num.size() - 2; reversed >= 0 && num[reversed] >= num[reversed + 1]; reversed--); 8 for (bigger = num.size() - 1; bigger > reversed && num[bigger] <= num[reversed]; bigger--); 9 10 if (reversed < bigger) {11 swap(num[reversed], num[bigger]);12 sort(num.begin() + reversed + 1, num.end());13 }14 else {15 reverse(num.begin(), num.end());16 }17 return;18 }19 };
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。