partition-list

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 the <code>head</code> of a linked list and a value <code>x</code>, partition it such that all nodes less than <code>x</code> come before nodes greater than or equal to <code>x</code>.

You should preserve the original relative order of the nodes in each of the two partitions.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/partition.jpg" style="width: 662px; height: 222px;" />
<pre>
Input: head = [1,4,3,2,5,2], x = 3
Output: [1,2,2,4,3,5]
</pre>

Example 2:

<pre>
Input: head = [2,1], x = 2
Output: [1,2]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is in the range <code>[0, 200]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
	<li><code>-200 &lt;= x &lt;= 200</code></li>
</ul>

partition

Partition List

Partition Array According to Given Pivot

partition-array-according-to-given-pivot

根据给定数字划分数组

Linked List

Two Pointers

给你一个链表的头节点 <code>head</code> 和一个特定值 <code>x</code> ，请你对链表进行分隔，使得所有 小于 <code>x</code> 的节点都出现在 大于或等于 <code>x</code> 的节点之前。

你应当 保留 两个分区中每个节点的初始相对位置。

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/partition.jpg" style="width: 662px; height: 222px;" />
<pre>
输入：head = [1,4,3,2,5,2], x = 3
输出：[1,2,2,4,3,5]
</pre>

示例 2：

<pre>
输入：head = [2,1], x = 2
输出：[1,2]
</pre>

 

提示：

<ul>
	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>
	<li><code>-100 <= Node.val <= 100</code></li>
	<li><code>-200 <= x <= 200</code></li>
</ul>