Leetcode Problem 86. Partition List

86. Partition List

Leetcode Solutions

Initialize two dummy nodes before_head and after_head to serve as the heads of the two new linked lists.
Use two pointers before and after to point to the current last node of the before and after lists, respectively.
Iterate through the original linked list.
For each node, if its value is less than x, append it to the before list.
If the node's value is greater than or equal to x, append it to the after list.
After the iteration, connect the before list to the after list by setting before.next to after_head.next.
Return before_head.next as the new head of the partitioned linked list.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen