Remove the Last Node
Remove the last node and return the head. Removing the only node of a one-node list gives an empty list (None), and an empty list stays 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]
returns [1,2]
The 3 goes away.
Example 2
head [8]
returns []
The list becomes empty.
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
- Split Into Two HalvesEasy
- 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