wiggle-sort-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, reorder it such that <code>nums[0] &lt; nums[1] &gt; nums[2] &lt; nums[3]...</code>.

You may assume the input array always has a valid answer.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
Input: nums = [1,3,2,2,3,1]
Output: [2,3,1,3,1,2]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 5000</code></li>
	<li>It is guaranteed that there will be an answer for the given input <code>nums</code>.</li>
</ul>

&nbsp;
Follow Up: Can you do it in <code>O(n)</code> time and/or in-place with <code>O(1)</code> extra space?

wiggleSort

Wiggle Sort II

Sort Colors

sort-colors

颜色分类

Kth Largest Element in an Array

kth-largest-element-in-an-array

数组中的第K个最大元素

Wiggle Sort

wiggle-sort

摆动排序

Array With Elements Not Equal to Average of Neighbors

array-with-elements-not-equal-to-average-of-neighbors

构造元素不等于两相邻元素平均值的数组

Greedy

Array

Divide and Conquer

Quickselect

Sorting

给你一个整数数组 <code>nums</code>，将它重新排列成 <code>nums[0] < nums[1] > nums[2] < nums[3]...</code> 的顺序。

你可以假设所有输入数组都可以得到满足题目要求的结果。

 

示例 1：

<pre>
输入：nums = [1,5,1,1,6,4]
输出：[1,6,1,5,1,4]
解释：[1,4,1,5,1,6] 同样是符合题目要求的结果，可以被判题程序接受。
</pre>

示例 2：

<pre>
输入：nums = [1,3,2,2,3,1]
输出：[2,3,1,3,1,2]
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 5 * 104</code></li>
	<li><code>0 <= nums[i] <= 5000</code></li>
	<li>题目数据保证，对于给定的输入 <code>nums</code> ，总能产生满足题目要求的结果</li>
</ul>

 

进阶：你能用 O(n) 时间复杂度和 / 或原地 O(1) 额外空间来实现吗？