将a[n…i]与a[i-1…0]相互交叉,避免相邻元素相等
void wiggleSort(vector<int>& nums) {
if(nums.empty()) return;
vector<int> vec(nums);
sort(vec.begin(),vec.end());
int n = nums.size();
int mid = n%2?n/2:n/2-1;
for(int i=n-1;i>mid;--i)
nums[2*(n-1-i)+1]=vec[i];
for(int i=mid;i>=0;--i)
nums[2*(mid-i)]=vec[i];
return;
}