Append a Value
Add a new node holding val at the very end of the list and return the head. If the list is empty, the new node becomes the head. 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]
val 3
returns [1,2,3]
The list becomes 1, 2, 3.
Example 2
head []
val 9
returns [9]
An empty list becomes just 9.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100-100 <= val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.