Split Into Two Halves
Split the list into a first half and a second half. If the length is odd, the first half gets the extra (middle) node. Return a Python list of two lists: the values of the first half, then the values of the second half. Both may be empty. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,3,4]
returns [[1,2],[3,4]]
[1, 2] and [3, 4].
Example 2
head [1,2,3,4,5]
returns [[1,2,3],[4,5]]
The middle 3 goes in the first half.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Sum Each PairEasy
- Swap Nodes in PairsEasy
- Values That Appear OnceEasy
- Add Two NumbersMedium
- Add Two Numbers IIMedium
- Cancel Opposite NeighborsMedium
- Delete the Middle NodeMedium
- Evens Before OddsMedium