280-WiggleSort

Wiggle Sort

Problem can be found in here!

Solution

def wiggleSort(nums: List[int]) -> None:
    for i in range(len(nums)-1):
        if (i % 2 == 0 and nums[i] > nums[i+1]) or (i % 2 == 1 and nums[i] < nums[i+1]):
            nums[i], nums[i+1] = nums[i+1], nums[i]

Time Complexity: , Space Complexity: