1
class Solution {
2
  public void wiggleSort(int[] nums) {
3
    int a[] = nums.clone();
4
    Arrays.sort(a);
5
    int left = (nums.length - 1) / 2;
6
    int right = nums.length - 1;
7
    for (int i = 0; i < nums.length; i++) {
8
      if (i % 2 == 0) {
9
        nums[i] = a[left];
10
        left--;
11
      } else {
12
        nums[i] = a[right];
13
        right--;
14
      }
15
    }
16
  }
17
}