324. Wiggle Sort II
Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
You may assume the input array always has a valid answer.
Example 1:
Input: nums = [1,5,1,1,6,4] Output: [1,6,1,5,1,4] Explanation: [1,4,1,5,1,6] is also accepted.
Example 2:
Input: nums = [1,3,2,2,3,1] Output: [2,3,1,3,1,2]
Constraints:
1 <= nums.length <= 5 * 1040 <= nums[i] <= 5000- It is guaranteed that there will be an answer for the given input
nums.
O(n) time and/or in-place with O(1) extra space?
GoogleTopics
Loading editor…
1class Solution:
2 def wiggleSort(self, nums: List[int]) -> None:
3 """
4 Do not return anything, modify nums in-place instead.
5 """
6
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def wiggleSort(self, nums: List[int]) -> None:
3 """
4 Do not return anything, modify nums in-place instead.
5 """
6
Starter codePython 3Spaces: 4
Examples
Input
[1,5,1,1,6,4]
Input
[1,3,2,2,3,1]
Your code is saved on this device.Solution