# Leecode#31 Next Permutation

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

Difficulty:Medium

123 132 213 231 312 321

void nextPermutation(vector<int>& nums) {
int len = nums.size();
int i = len-1,j=len-1;
int temp;
if(len==1||len==0)
return;
if(len==2)
{
temp = nums[0];
nums[0]=nums[1];
nums[1]=temp;
return;
}
while(i>=1)
{
if(nums[i]<=nums[i-1])
i--;
else
break;
}
i--;
if(i==-1)
{
sort(nums.begin(),nums.end());
return;
}
while(j>=0)
{
if(nums[j]<=nums[i])
j--;
else
break;

}
temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
for(int k =i+1;k<=((len-1-i-1)/2+i+1);k++)
{
temp = nums[k];
nums[k] = nums[len-1-(k-(i+1))];
nums[len-1-(k-(i+1))] = temp;
}
return;
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：Leecode#31 Next Permutation 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)