classSolution{public:voidwiggleSort(vector<int>&nums){// 1. If i is even, then nums[i] <= nums[i - 1].// 2. If i is odd, then nums[i] >= nums[i - 1].for(inti=1;i<nums.size();++i)if(i%2==0&&nums[i]>nums[i-1]||i%2==1&&nums[i]<nums[i-1])swap(nums[i],nums[i-1]);}};
1 2 3 4 5 6 7 8 910111213141516
classSolution{publicvoidwiggleSort(int[]nums){// 1. If i is even, then nums[i] <= nums[i - 1].// 2. If i is odd, then nums[i] >= nums[i - 1].for(inti=1;i<nums.length;++i)if(i%2==0&&nums[i]>nums[i-1]||//i%2==1&&nums[i]<nums[i-1])swap(nums,i,i-1);}privatevoidswap(int[]nums,inti,intj){finalinttemp=nums[i];nums[i]=nums[j];nums[j]=temp;}}
12345678
classSolution:defwiggleSort(self,nums:list[int])->None:# 1. If i is even, then nums[i] <= nums[i - 1].# 2. If i is odd, then nums[i] >= nums[i - 1].foriinrange(1,len(nums)):if(i%2==0andnums[i]>nums[i-1]ori%2==1andnums[i]<nums[i-1]):nums[i],nums[i-1]=nums[i-1],nums[i]