mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
28 lines
990 B
HTML
28 lines
990 B
HTML
|
<p>Given the <code>head</code> of a linked list and a value <code>x</code>, partition it such that all nodes <strong>less than</strong> <code>x</code> come before nodes <strong>greater than or equal</strong> to <code>x</code>.</p>
|
||
|
|
|
||
|
|
<p>You should <strong>preserve</strong> the original relative order of the nodes in each of the two partitions.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/partition.jpg" style="width: 662px; height: 222px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> head = [1,4,3,2,5,2], x = 3
|
||
|
|
<strong>Output:</strong> [1,2,2,4,3,5]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> head = [2,1], x = 2
|
||
|
|
<strong>Output:</strong> [1,2]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>The number of nodes in the list is in the range <code>[0, 200]</code>.</li>
|
||
|
|
<li><code>-100 <= Node.val <= 100</code></li>
|
||
|
|
<li><code>-200 <= x <= 200</code></li>
|
||
|
|
</ul>
|