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 324 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 324 # by problem number
lcpy gen -s wiggle_sort_ii # 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.
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.
Input: nums = [1,3,2,2,3,1]
Output: [2,3,1,3,1,2]
1 <= nums.length <= 5 * 10^40 <= nums[i] <= 5000nums.O(n) time and/or in-place with O(1) extra space?
class Solution:
# Time: O(n log n)
# Space: O(n)
def wiggle_sort(self, nums: list[int]) -> None:
sorted_nums = sorted(nums)
n = len(nums)
nums[::2] = sorted_nums[: (n + 1) // 2][::-1]
nums[1::2] = sorted_nums[(n + 1) // 2 :][::-1]
| Time | Space |
|---|---|
| O(n log n) | O(n) |