< Previous 　　　　　　　　　　　　　　　　 Next >

280. Wiggle Sort (Medium)

Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]....

Example:

Input: nums = [3,5,2,1,6,4]
Output: One possible answer is [3,5,1,6,2,4]

Related Topics

[Greedy] [Array] [Sorting]

Similar Questions

1. Sort Colors (Medium)
2. Wiggle Sort II (Medium)