Given `head`, the head of a linked list, determine if the linked list has a cycle in it.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer.
checklist Constraints
The number of the nodes in the list is in the range [0, 10^4]. -10^5 <= Node.val <= 10^5