Cancel Opposite Neighbors
Whenever two neighboring nodes hold values that add up to 0 (like 3 and -3), both are removed. After a removal the nodes around the gap may become neighbors and cancel too. Keep going until nothing more can be removed, then return the head. For 2 -> 5 -> -5 -> -2 -> 7 everything cancels except the 7. 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 [2,5,-5,-2,7]
returns [7]
5,-5 cancel, then 2,-2 cancel.
Example 2
head [1,2,3]
returns [1,2,3]
Nothing cancels.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100, and no value is 0
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Delete the Middle NodeMedium
- Evens Before OddsMedium
- Last One StandingMedium
- Length of the CycleMedium
- Maximum Twin SumMedium
- Move a Value to the EndMedium
- Odd Even Linked ListMedium
- Partition ListMedium