Method wiggleSort

Sorted/WiggleSortII.py:59–94

:type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead.

(self, nums)

"""
class Solution(object):
    def wiggleSort(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        
        nums.sort()
        middle = nums[len(nums) // 2]
        larger = [i for i in nums[len(nums)//2:] if i != middle]
        smaller = [i for i in nums[:len(nums)//2] if i != middle]
        equal = [i for i in nums if i == middle]
        
        larger.reverse()
        smaller.reverse()
        length = len(nums)
        odd = 1
        even = length - 1 if (length-1) % 2 == 0 else length - 2
        
        for i in larger:
            # try:
            nums[odd] = i

            odd += 2
        
        for i in smaller:
            nums[even] = i
            
            even -= 2
        
        while even >= 0:
            nums[even] = equal.pop()
            even -= 2
        
        while odd < length:
            nums[odd] = equal.pop()
            odd += 2