Move the Last Node to the Front
Take the last node and make it the new head, keeping the order of all the other nodes. Return the new head. Lists with 0 or 1 nodes stay as they are. 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 [4,1,2,3]
The 4 jumps to the front.
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.