{leetcode}/problems/partition-list/[LeetCode - 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
思路很简单，直接双指针维护大小两个队列就好。
- 一刷
-
link:{sourcedir}/_0086_PartitionList.java[role=include] - 二刷
-
link:{sourcedir}/_0086_PartitionList_2.java[role=include]