def wiggleSort(self, nums):
        for i in xrange(1, len(nums)):
            if ((i % 2) and nums[i - 1] > nums[i]) or \
                (not (i % 2) and nums[i - 1] < nums[i]):
                # Swap unordered elements.
                nums[i - 1], nums[i] = nums[i], nums[i - 1]
:type nums: List[int]
dataset/ETHPy150Open kamyu104/LeetCode/Python/wiggle-sort.py/Solution.wiggleSort