首页 > itarticle > [lintcode] problem 508 – wiggle sort

[lintcode] problem 508 – wiggle sort

admin 11月 13, 2020 0

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]

Code


// 推导出此时 nums[i] >= nums[i - 2]，因此交换之后，不会让 nums[i] 和 nums[i - 2] 的大小关系出现变化。
public void (int[] nums) {
    for (int i = 0; i < nums.length - 1 ; i++) {
        if ((i % 2 == 0 && nums[i] > nums[i + 1]) || (i % 2 != 0 && nums[i] < nums[i + 1]))
            swap(nums, i, i + 1);
    }
}

private void swap(int[] nums, int i, int j) {
    int temp = nums[i];
    nums[i] = nums[j];
    nums[j] = temp;
}