STL or Manual
- STL
class Solution {
public:
void nextPermutation(vector<int>& nums) {
next_permutation(nums.begin(), nums.end());
}
};
- Manual
class Solution {
public:
void nextPermutation(vector<int>& nums) {
int i = nums.size() - 2;
while(0 <= i && nums[i + 1] <= nums[i]){
i--;
}
if(i >= 0){
int j = nums.size() - 1;
while(0 <= j && nums[j] <= nums[i]){
j--;
}
swap(nums, i, j);
}
reverse(nums, i + 1);
}
void reverse(vector<int>& nums,int i){
int j = nums.size() - 1;
while(i < j) {
swap(nums, i, j);
i++;
j--;
}
}
void swap(vector<int>& nums,int i,int j){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
};
题目链接:https://leetcode-cn.com/problems/next-permutation/