interviews/leetcode/array/WiggleSort.java at master · codingOnGithub/interviews · GitHub

16 lines (13 loc) · 528 Bytes

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

// For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].

public class WiggleSort {

public void wiggleSort(int[] nums) {

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

int current = nums[i - 1];

if((i % 2 == 1) == (current > nums[i])) {

nums[i - 1] = nums[i];

nums[i] = current;

}

Expand file tree