LeetCode *** 324. Wiggle Sort II （virtual indexing）

题目：

Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....

Example:
(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1, 4, 1, 5, 1, 6].
(2) Given nums = [1, 3, 2, 2, 3, 1], one possible answer is [2, 3, 1, 3, 1, 2].

Note:
You may assume all input has valid answer.

Follow Up:
Can you do it in O(n) time and/or in-place with O(1) extra space?

分析：

https://leetcode.com/discuss/77133/o-n-o-1-after-median-virtual-indexing

这是这个人的题解，我一直没弄出来，看了他的答案觉得很棒！

代码：

 class Solution {
 public:
	 void wiggleSort(vector<int>& nums) {

		 int size = nums.size();

		 auto midptr=nums.begin()+size/2;
		 nth_element(nums.begin(),midptr,nums.end());
		 int mid=*midptr;
		 
		 int i=0,j=0,k=size-1;
		 #define A(i) nums[(1+i*2)%(size|1)]
		 
		 while(j<=k){
		     if(A(j)>mid)
		        swap(A(i++),A(j++));
		     else if(A(j)<mid)
		        swap(A(j),A(k--));
		     else j++;
		 }

	 }
 };