LinkedListCycle141.kt

package easy

import medium.ListNode

/**
 * 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. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.

Return true if there is a cycle in the linked list. Otherwise, return false.



Example 1:


Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).
Example 2:


Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 0th node.
Example 3:


Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.


Constraints:

The number of the nodes in the list is in the range [0, 104].
-105 <= Node.val <= 105
pos is -1 or a valid index in the linked-list.
 */
fun hasCycle(head: ListNode?): Boolean {

    if (head?.next == null) return false

    val map = HashMap<ListNode, Boolean>()
    var hasCycle = false
    var h = head

    while (h != null && !hasCycle) {
        val curr = map[h]
        if (curr == false) {
            // mark this node is visited
            map[h] = true
        } else {
            hasCycle = true
        }
        h = h.next
    }
    return hasCycle

}
fun hasCycle2(head: ListNode?): Boolean {
    if (head?.next == null) return false
    var slow=head
    var fast=head
    while (fast!=null || fast?.next!=null)
    {
        slow =slow?.next
        fast=fast?.next?.next
        if(slow==fast)
            return true
    }
    return false
}