21、调整数组顺序

使用一次快排最简单
class Solution {
public:
vector exchange(vector& nums)
{
int i=0,j=nums.size()-1;
while(i<j)
{
if(nums[i]%20&&nums[j]%21)
{
int tem=nums[i];
nums[i]=nums[j];
nums[j]=tem;
i++;
j–;
}
else if(nums[i]%20&&nums[j]%20)j–;
else if(nums[i]%21&&nums[j]%21)i++;
else
{
i++;
j–;
}
}
return nums;
}
};