class Solution {
public:
void nextPermutation(vector& nums) {
int i1;
int i2;
bool hasPermutation = false;
for(int i=nums.size()-1; i>0; i--){
if(nums[i-1]i1; i--){
if(nums[i]>nums[i1]){
j=i;
break;
}
}
swap(nums[i1], nums[j]);
reverse(nums.begin()+i1+1, nums.end());
}else{
sort(nums.begin(), nums.end());
}
}
};