280. Wiggle Sort

Problem

Reorder an array in-place so that nums[0] <= nums[1] >= nums[2] <= nums[3]...

Given an integer array nums, reorder it in-place such that:

  • nums[0] <= nums[1] >= nums[2] <= nums[3]...

This is called wiggle sort.

Examples
Input: [3,5,2,1,6,4]
Output: [3,5,1,6,2,4]
Hints
Related Problems

280. Wiggle Sort

Reorder an array in-place so that nums[0] <= nums[1] >= nums[2] <= nums[3]...