324. Wiggle Sort II
Posted simplepaul
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了324. Wiggle Sort II相关的知识,希望对你有一定的参考价值。
324. Wiggle Sort II
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?
以上是关于324. Wiggle Sort II的主要内容,如果未能解决你的问题,请参考以下文章
java 324. Wiggle Sort II(#)。java
java 324. Wiggle Sort II(#)。java
java 324. Wiggle Sort II(#)。java
java 324. Wiggle Sort II(#)。java