Skip to content

Latest commit

 

History

History
49 lines (30 loc) · 1.13 KB

0086-partition-list.adoc

File metadata and controls

49 lines (30 loc) · 1.13 KB

86. Partition List

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

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

Example:
Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5

解题分析

思路很简单,直接双指针维护大小两个队列就好。

{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

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

Example:

Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5
link:{sourcedir}/_0086_PartitionList.java[role=include]