280. Wiggle Sort

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

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

class Solution {
    public void wiggleSort(int[] nums) {
        for(int i = 1; i < nums.length; i++){
            if (i % 2 == 0){
                if (nums[i] > nums[i - 1]){
                    swap(nums, i, i - 1);
                }
            } else {
                if (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;
    }
}

class Solution:
    def wiggleSort(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        for i in range(1, len(nums)):
            if i % 2 == 1 and nums[i] < nums[i - 1] or i % 2 != 1 and nums[i] > nums[i - 1]:
                temp = nums[i]
                nums[i] = nums[i - 1]
                nums[i - 1] = temp