public class Solution {

    /**

     * @param nums a list of integer

     * @return void

     */

    public void wiggleSort(int[] nums) {

        // Write your code here

        if(nums == null || nums.length == 0)

            return;

        Arrays.sort(nums);// 排序

        int[] temp = new int[nums.length];

        int mid = nums.length%2==0?nums.length/2-1:nums.length/2;// 中间下标

        int index = 0;

        for(int i=0;i<=mid;i++){

            temp[index] = nums[mid-i];

            if(index+1<nums.length)

                temp[index+1] = nums[nums.length-i-1];

                index = index+2;

            }

        for(int i=0;i<nums.length;i++){

            nums[i] = temp[i];

        }

    }

}