Given an unsorted array nums
, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]...
.
Example:
(1) Given nums = [1, 5, 1, 1, 6, 4]
, one possible answer is [1, 4, 1, 5, 1, 6]
.
(2) Given nums = [1, 3, 2, 2, 3, 1]
, one possible answer is [2, 3, 1, 3, 1, 2]
.
Note:
You may assume all input has valid answer.
Follow Up:
Can you do it in O(n) time and/or in-place with O(1) extra space?
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
排序,分成两半,小的倒着排,大的正着排
class Solution(object):
def wiggleSort(self, nums):
nums.sort()
l = len(nums)
b = l / 2
res = [0] * l
flag = l%2
for i in xrange(0,l,2):
pos = l-i-2 + flag
res[pos] = nums[i/2]
for i in xrange(1,l,2):
pos = l - ((1 + i)/2 )
res[i] = nums[pos]
nums[:] = res[:]