class Solution {
public:
void nextPermutation(vector<int>& nums) {
for(int i=nums.size()-1;i>0;i--){
if(nums[i]>nums[i-1]){
int j=i-1;
while(nums[++j]>nums[i-1]&&j<nums.size());
swap(nums[j-1],nums[i-1]);
reverse(nums.begin()+i,nums.end());
return;
}
}
reverse(nums.begin(),nums.end());
}
};
LeetCode Day26 Next Permutation
猜你喜欢
转载自blog.csdn.net/weixin_41394379/article/details/83340161
今日推荐
周排行