# Leecode#31 Next Permutation

140人阅读 评论(0)

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;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：30104次
• 积分：3268
• 等级：
• 排名：第10395名
• 原创：311篇
• 转载：4篇
• 译文：0篇
• 评论：1条
文章分类
评论排行
最新评论