leetcode——324——Wiggle Sort II
来源:互联网 发布:c语言程序停止 编辑:程序博客网 时间:2024/06/05 06:26
Given an unsorted array
nums
, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]...
.Example:
(1) Given nums = [1, 5, 1, 1, 6, 4]
, one possible answer is [1, 4, 1, 5, 1, 6]
.
(2) Given nums = [1, 3, 2, 2, 3, 1]
, 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?
0 0
- leetcode——324——Wiggle Sort II
- [LeetCode 324] Wiggle Sort II
- leetcode-Wiggle Sort II-324
- LeetCode[324] Wiggle Sort II
- LeetCode #324 Wiggle Sort II
- leetcode:sort:Wiggle Sort II(324)
- leetcode Wiggle Sort II
- LeetCode Wiggle Sort II
- leetcode Wiggle Sort II
- Leetcode Wiggle Sort II
- Leetcode Wiggle Sort II
- LeetCode: Wiggle Sort II
- LeetCode -- Wiggle Sort II
- Leetcode Wiggle Sort and Wiggle Sort II
- leetcode之Wiggle Sort II
- [leetcode] - 324. Wiggle Sort II
- [LeetCode]324. Wiggle Sort II
- leetcode 324. Wiggle Sort II
- 继续sizeof与strlen的区别,来一拨
- 第8周项目2-用数组对象操作长方柱类
- HTML基础
- 回调函数
- 【Android】 TextView设置个别字体样式
- leetcode——324——Wiggle Sort II
- div专题
- JS求数组差集
- JAVA 32位随机ID
- BeeFramework路由机制
- qt使用样式表修改控件属性
- jpype和HanLP
- ZOJ 3916|Buy Cakes|贪心|堆
- 我的Hexo博客建站日志