调用函数
class Solution {
public:
void nextPermutation(vector<int>& nums) {
next_permutation(nums.begin(), nums.end());
}
};
自己写
class Solution {
public:
void nextPermutation(vector<int>& nums) {
int i = nums.size() - 1;
while (i && nums[i - 1] >= nums[i]) --i;
if (i) {
int k = i;
while (k + 1 != nums.size() && nums[k + 1] > nums[i - 1]) ++k;
swap(nums[i - 1], nums[k]);
}
reverse(nums.begin() + i, nums.end());
}
};