leetcode之Wiggle Sort II

class Solution(object):
def wiggleSort(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
nums.sort()
if len(nums) % 2 != 0:
for i in range(len(nums) / 2):
a = nums[i + len(nums) / 2 + 1]
del nums[i + len(nums) / 2 + 1]
nums.insert(2 * i + 1, a)
else:
if len(nums) == 4:
if nums[1] == nums[2]:
for i in range(2):
a = nums.pop()
nums.insert(0, a)
else:
for i in range(len(nums) / 2):
a = nums[i + len(nums) / 2]
del nums[i + len(nums) / 2]
nums.insert(2 * i + 1, a)

else:
for i in range(len(nums) / 2):
a = nums[i + len(nums) / 2]
del nums[i + len(nums) / 2]
nums.insert(2 * i + 1, a)