86. Partition List
Problem description:
Given the head of 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 1:
Input: head = [1,4,3,2,5,2], x = 3
Output: [1,2,2,4,3,5]
Example 2:
Input: head = [2,1], x = 2
Output: [1,2]
Solution:
1 | # Definition for singly-linked list. |
time complexity: $O(n)$
space complexity: $O(1)$
reference:
related problem: