没啥特别的,另一种形式的冒泡排序。
先把答案做出来,下一步想想怎么优化,留个坑先。
class Solution(object):
"""
@param {int[]} nums a list of integer
@return nothing, modify nums in-place instead
"""
def wiggleSort(self, nums):
# Write your code here
L = nums
ans_list = []
len_L = len(L)
if len_L == 0:
return 0
if len_L == 1:
return L
for i in range(0, len_L):
for j in range(i+1, len_L):
if i%2 == 1:
if L[j] > L[i]:
L[i], L[j] = L[j], L[i]
break
else:
if L[j] < L[i]:
L[i], L[j] = L[j], L[i]
break