leetcode 31. Next Permutation
2016-09-16 18:42
253 查看
从numsSize-2的位置开始向前,对于每一个该position的数,从numsSize-1到position+1找到一个比nums[position]大的数,并且调换位置,这时候从position+1开始的数就是逆序排列了,这是我找到的规律。把这段逆序序列调成正序序列,就得到了想要的结果。如果每个数都找不到后边的比它大的数,说明整个序列是逆序的,调成正序即可。
#include <stdio.h>
#include <stdlib.h>
void rearrange(int *nums, int position,int numsSize)
{
int temp,i,j;
for(i=numsSize-1;i>position;i--)
{
if(nums[i]>nums[position])
{
temp=nums[i];
nums[i]=nums[position];
nums[position]=temp;
//此时position后边的逆序排列,调成正序
for(j=0;j<(numsSize-position-1)/2;j++)
{
temp=nums[j+position+1];
nums[j+position+1]=nums[numsSize-j-1];
nums[numsSize-j-1]=temp;
}
return;
}
}
if(position==0) //position不能前移,此时全部逆序排列,反向就正序了
{
for(i=0;i<numsSize/2;i++)
{
temp=nums[i];
nums[i]=nums[numsSize-i-1];
nums[numsSize-i-1]=temp;
}
return;
}
else
rearrange(nums,position-1,numsSize);
}
void nextPermutation(int* nums, int numsSize) {
if(numsSize<=1)
;
else
rearrange(nums,numsSize-2,numsSize);
}
int main()
{
int nums[5]={3,1,5,4,2};
nextPermutation(nums,5);
for(int i=0;i<5;i++)
printf("%d ",nums[i]);
return 0;
}
#include <stdio.h>
#include <stdlib.h>
void rearrange(int *nums, int position,int numsSize)
{
int temp,i,j;
for(i=numsSize-1;i>position;i--)
{
if(nums[i]>nums[position])
{
temp=nums[i];
nums[i]=nums[position];
nums[position]=temp;
//此时position后边的逆序排列,调成正序
for(j=0;j<(numsSize-position-1)/2;j++)
{
temp=nums[j+position+1];
nums[j+position+1]=nums[numsSize-j-1];
nums[numsSize-j-1]=temp;
}
return;
}
}
if(position==0) //position不能前移,此时全部逆序排列,反向就正序了
{
for(i=0;i<numsSize/2;i++)
{
temp=nums[i];
nums[i]=nums[numsSize-i-1];
nums[numsSize-i-1]=temp;
}
return;
}
else
rearrange(nums,position-1,numsSize);
}
void nextPermutation(int* nums, int numsSize) {
if(numsSize<=1)
;
else
rearrange(nums,numsSize-2,numsSize);
}
int main()
{
int nums[5]={3,1,5,4,2};
nextPermutation(nums,5);
for(int i=0;i<5;i++)
printf("%d ",nums[i]);
return 0;
}
相关文章推荐
- [LeetCode]31. Best Time to Buy and Sell Stock股票买卖
- LeetCode 31 Next Permutation
- LeetCode 31. Next Permutation(下一个排列)
- leetcode解题之31. Next Permutation java 版(下一个排列)
- leetcode 31. Next Permutation
- <LeetCode OJ>Next Permutation【31】
- [LeetCode]31. Next Permutation
- LeetCode 31 Next Permutation
- LeetCode 31 Next Permutation (C,C++,Java,Python)
- 31 leetcode - Search for a Range
- LeetCode 31 Next Permutation (下一个排列)
- leetcode-31-NextPermutation
- leetcode 31 next permutation
- [Leetcode] 31. Next Permutation
- [leetcode]31. Next Permutation -Find next greater number with same set of digits
- leetcode31---Next Permutation
- leetcode 31. Next Permutation
- leetcode_permutaionu全排列集合_31_46_47_60
- [LeetCode] 31. Next Permutation
- leetcode_31. Next Permutation