rearrange-array-elements-by-sign

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed integer array <code>nums</code> of even length consisting of an equal number of positive and negative integers.

You should return the array of nums such that the the array follows the given conditions:

<ol>
	<li>Every consecutive pair of integers have opposite signs.</li>
	<li>For all integers with the same sign, the order in which they were present in <code>nums</code> is preserved.</li>
	<li>The rearranged array begins with a positive integer.</li>
</ol>

Return the modified array after rearranging the elements to satisfy the aforementioned conditions.

&nbsp;
Example 1:

<pre>
Input: nums = [3,1,-2,-5,2,-4]
Output: [3,-2,1,-5,2,-4]
Explanation:
The positive integers in nums are [3,1,2]. The negative integers are [-2,-5,-4].
The only possible way to rearrange them such that they satisfy all conditions is [3,-2,1,-5,2,-4].
Other ways such as [1,-2,2,-5,3,-4], [3,1,2,-2,-5,-4], [-2,3,-5,1,-4,2] are incorrect because they do not satisfy one or more conditions. 
</pre>

Example 2:

<pre>
Input: nums = [-1,1]
Output: [1,-1]
Explanation:
1 is the only positive integer and -1 the only negative integer in nums.
So nums is rearranged to [1,-1].
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 2 * 105</code></li>
	<li><code>nums.length</code> is even</li>
	<li><code>1 &lt;= |nums[i]| &lt;= 105</code></li>
	<li><code>nums</code> consists of equal number of positive and negative integers.</li>
</ul>

&nbsp;
It is not required to do the modifications in-place.

rearrangeArray

Rearrange Array Elements by Sign

Wiggle Subsequence

wiggle-subsequence

摆动序列

Sort Array By Parity II

sort-array-by-parity-ii

按奇偶排序数组 II

Partition Array According to Given Pivot

partition-array-according-to-given-pivot

根据给定数字划分数组

Largest Number After Digit Swaps by Parity

largest-number-after-digit-swaps-by-parity

按奇偶性交换后的最大数字

Array

Two Pointers

Simulation

给你一个下标从 0 开始的整数数组 <code>nums</code> ，数组长度为 偶数 ，由数目 相等 的正整数和负整数组成。

你需要返回满足下述条件的数组&nbsp;<code>nums</code>：

<ol>
	<li>任意&nbsp;连续 的两个整数 符号相反</li>
	<li>对于符号相同的所有整数，保留 它们在 <code>nums</code> 中的 顺序 。</li>
	<li>重排后数组以正整数开头。</li>
</ol>

重排元素满足上述条件后，返回修改后的数组。

&nbsp;

示例 1：

<pre>
输入：nums = [3,1,-2,-5,2,-4]
输出：[3,-2,1,-5,2,-4]
解释：
nums 中的正整数是 [3,1,2] ，负整数是 [-2,-5,-4] 。
重排的唯一可行方案是 [3,-2,1,-5,2,-4]，能满足所有条件。
像 [1,-2,2,-5,3,-4]、[3,1,2,-2,-5,-4]、[-2,3,-5,1,-4,2] 这样的其他方案是不正确的，因为不满足一个或者多个条件。 
</pre>

示例 2：

<pre>
输入：nums = [-1,1]
输出：[1,-1]
解释：
1 是 nums 中唯一一个正整数，-1 是 nums 中唯一一个负整数。
所以 nums 重排为 [1,-1] 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 2 * 105</code></li>
	<li><code>nums.length</code> 是 偶数</li>
	<li><code>1 &lt;= |nums[i]| &lt;= 105</code></li>
	<li><code>nums</code> 由 相等 数量的正整数和负整数组成</li>
</ul>

&nbsp;

不需要原地进行修改。