java 280. Wiggle Sort（＃）。java

Posted 2021-05-08

public class Solution {
    public void wiggleSort(int[] nums) {
        if (nums == null || nums.length < 1) return;
        for (int i = 0; i < nums.length; i++) {
            if (i % 2 == 1) {
                if (nums[i - 1] > nums[i]) swap(nums, i);
            } else if(i > 0 && nums[i - 1] < nums[i]){
                swap(nums, i);
            }
        }
    }
    private void swap(int[] nums, int i) {
        int temp = nums[i];
        nums[i] = nums[i - 1];
        nums[i - 1] = temp;
    }
}