Rotate Linked List
MediumP2Coding
Rotate a singly linked list to the right by k places and return the new head. Rotating by one moves the last node to the front. A list node has val and next. The ListNode class is already defined for you.
k can be larger than the length of the list.
Example 1
- Input
- head = [1,2,3,4,5], k = 2
- Output
- [4,5,1,2,3]
Example 2
- Input
- head = [0,1,2], k = 4
- Output
- [2,0,1]
- Why
- 4 mod 3 = 1 rotation.
Example 3
- Input
- head = [], k = 3
- Output
- []
Constraints
- 0 <= number of nodes <= 500
- -100 <= Node.val <= 100
- 0 <= k <= 2 * 10^9
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 11. ⌘Enter runs, ⌘⇧Enter submits.