gouthampradhan / leetcode Goto Github PK

public boolean hasCycle(ListNode head) {
        ListNode slow = head;
        ListNode fast = head;
        while (slow != null && fast != null) {
            slow = slow.next;
            fast = fast.next;

            if (fast != null)
                fast = fast.next;
            else {
                break;
            }
            if (fast != null && slow != null)
                if (fast.equals(slow)) {
                    return true;
                }
        }
        return false;
    }

public boolean hasCycle(ListNode head){
		ListNode slow = head;
		ListNode fast = head;
		while(fast != null && fast.next != null){
			slow = slow.next;
			fast = fast.next.next;
			if(slow == fast) {
				return true;
			}
		}
		return false;
	}