LeetCode-Wiggle Sort

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].

Analysis:

We just need to substitute each two consecutive numbers to make the arrya wiggle.

Solution:

public class Solution {
    public void wiggleSort(int[] nums) {
        boolean isDec = false;
        for (int i=0;i<nums.length-1;i++){
            if ((isDec && nums[i]<nums[i+1]) || (!isDec && nums[i]>nums[i+1])){
                int temp = nums[i+1];
                nums[i+1] = nums[i];
                nums[i] = temp;
            }
            isDec = !isDec;
        }
        
    }
}