280. Wiggle Sort (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution(object):
    def wiggleSort(self, nums):
        """
        :type nums: List[int]
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        # straight forward solution
        for i in range(1, len(nums)):
            if i % 2 == 1:
                if nums[i] < nums[i - 1]:
                    nums[i], nums[i - 1] = nums[i - 1], nums[i]
            else:
                if nums[i] > nums[i - 1]:
                    nums[i], nums[i - 1] = nums[i - 1], nums[i]
    
        # sort solution
        nums.sort()
        result = []
        for i in range(len(nums)):
            if i % 2 == 0:
                result.append(nums[i // 2])
            else:
                result.append(nums[-(i + 1) // 2])
        nums[ : ] = result