280. Wiggle Sort

#leet_code #array #greedy

class Solution:
    def wiggleSort(self, nums: List[int]) -> None:

        for i in range(1, len(nums)):
            if i % 2 == 1:
                if nums[i] < nums[i - 1]:
                    nums[i - 1], nums[i] = nums[i], nums[i - 1]
            else:
                if nums[i] > nums[i - 1]:
                    nums[i - 1], nums[i] = nums[i], nums[i - 1]