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
分析:
解题代码:
class Solution {
public:
void nextPermutation(vector<int> &num)
{
if (num.size()<=1)
{
return;
}
int k=num.size()-1;bool flag=false;
while(k>0)
{
if (num[k]>num[k-1])
{
k--;
flag=true;
break;
}
else k--;
}
if (flag==false)
{
reverseArray(num,0);
return;
}
else
{
int ss=num.size()-1;
while(num[k]>=num[ss])
{
ss--;
}
int a=num[k];
num[k]=num[ss];
num[ss]=a;
reverseArray(num,k+1);
}
}
public:
void reverseArray(vector<int>&num,int flag)
{
int highNumber=num.size()-1;
if (flag>=highNumber)
{
return;
}
while(flag<highNumber)
{
int ll=num[flag];
num[flag]=num[highNumber];
num[highNumber]=ll;
flag++;highNumber--;
}
return;
}
};