LeetCode 324摆动排序(java)

class Solution {
    public void wiggleSort(int[] nums) {
       Arrays.sort(nums);
        int len = nums.length;
        // 数组克隆,再排序
        int[] temp = nums.clone();
        for(int i = 0; i < len/ 2; i++) {
            nums[2 * i] = temp[(len - 1) / 2 - i];
            nums[2 * i + 1] = temp[len -1 - i];
        }
        if(len % 2 == 1)
            nums[len - 1] = temp[0];
    }
}