Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 280 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 280 # by problem number
lcpy gen -s wiggle_sort # by problem name
nums, reorder it such that nums[0] <= nums[1] >= nums[2] <= nums[3]....
You may assume the input array always has a valid answer.
Follow up: Could you solve the problem in O(n) time complexity?
Input: nums = [3,5,2,1,6,4]
Output: [3,5,1,6,2,4]
Explanation: [1,6,2,5,3,4] is also accepted.
Input: nums = [6,6,5,6,3,8]
Output: [6,6,5,6,3,8]
1 <= nums.length <= 5 * 10^40 <= nums[i] <= 10^4nums.class Solution:
# Time: O(n)
# Space: O(1)
def wiggle_sort(self, nums: list[int]) -> None:
for i in range(1, len(nums)):
if (i % 2 == 1 and nums[i] < nums[i - 1]) or (i % 2 == 0 and nums[i] > nums[i - 1]):
nums[i - 1], nums[i] = nums[i], nums[i - 1]
| Time | Space |
|---|---|
| O(n) | O(1) |