0324-wiggle-sort-ii.adoc

324. Wiggle Sort II

{leetcode}/problems/wiggle-sort-ii/[LeetCode - Wiggle Sort II^]

思考题：

1. 排序再穿插，这个再思考一下？

2. 找中位数然后索引映射的解法再学习一下。

参考资料

1. {leetcode}/problems/wiggle-sort-ii/discuss/77677/O(n)%2BO(1)-after-median-Virtual-Indexing[O(n)+O(1) after median --- Virtual Indexing - LeetCode Discuss^]

2. {leetcode}/problems/wiggle-sort-ii/discuss/77682/Step-by-step-explanation-of-index-mapping-in-Java[Step by step explanation of index mapping in Java - LeetCode Discuss^]

3. Java详细题解说明 - 摆动排序 II - 力扣（LeetCode）

4. 一步一步将时间复杂度从O(NlogN)降到O(N)，将空间复杂度从O(N)降低到O(1) - 摆动排序 II - 力扣（LeetCode）

Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]…​.

Example 1:

Input: nums = [1, 5, 1, 1, 6, 4]
Output: One possible answer is [1, 4, 1, 5, 1, 6].

Example 2:

Input: nums = [1, 3, 2, 2, 3, 1]
Output: 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?

link:{sourcedir}/_0324_WiggleSortII.java[role=include]