wiggle sort II

题目描述：
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?

思路一:
排序+后向插入 时间O(nlogn)+ 空间O(n)
思路二：
1、找到中位数，左边小于等于中位数，右边大于等于中位数
2、如果后向插入，有可能有重复的。因为中位数可以在左边和右边。所以我们先将中位数集中在一起，再后向插入
代码
public class Solution {
    public void wiggleSort(int[] nums) {
//      Arrays.sort(nums);
        findMedian(0, nums.length-1, nums);
        int[] result = new int[nums.length];
        int median = nums[nums.length >> 1];
        int i=0,j=0,k=nums.length-1;
        while(i < nums.length)
        {
            if(nums[i] != median && i < nums.length >> 1)
            {
                result[j++] = nums[i];
            }
            if(nums[i] != median && i > nums.length >> 1)
            {
                result[k--] = nums[i];
            }
            i++;
        }
        while(j <= k){result[j++] = median;}
        int mid = nums.length % 2 == 0 ? (nums.length >> 1) - 1 : nums.length >> 1;
        i = mid ; j = nums.length-1;
        k = 0;
        while(k < nums.length)
        {
            if(i >= 0)
                nums[k++] = result[i--];
            if(j > mid)
                nums[k++] = result[j--];
        }
    }
    private void findMedian(int begin, int end, int[] nums)
    {
        if(begin >= end) return;
        int mid = sort(begin, end, nums);
        if(mid == nums.length >> 1){return;}
        if(mid > nums.length >> 1) findMedian(begin, mid-1, nums);
        else
            findMedian(mid+1, end, nums);
    }
    private int sort(int begin, int end, int[] nums)
    {
        int target = nums[end];
        while(begin < end)
        {
            while(begin < end && nums[begin] <= target)
            {
                begin ++ ;
            }
            if(begin < end){nums[end--] = nums[begin];}
            while(begin < end && nums[end] >= target)
            {
                end -- ;
            }
            if(begin < end){nums[begin++] = nums[end];}
        }
        nums[begin] = target;
        return begin;
    }
}