141 Linked List Cycle 環(huán)形鏈表

Description:
Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example:

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

Example 1

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

Example 2

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

Example 3

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

題目描述:
給定一個(gè)鏈表沽讹，判斷鏈表中是否有環(huán)。

為了表示給定鏈表中的環(huán)琅拌，我們使用整數(shù) pos 來表示鏈表尾連接到鏈表中的位置（索引從 0 開始）惨缆。 如果 pos 是 -1绘搞，則在該鏈表中沒有環(huán)。

示例：

示例 1：
輸入：
head = [3,2,0,-4], pos = 1
輸出：
true
解釋：
鏈表中有一個(gè)環(huán)，其尾部連接到第二個(gè)節(jié)點(diǎn)挽荡。

示例 1

示例 2：
輸入：
head = [1,2], pos = 0
輸出：
true
解釋：
鏈表中有一個(gè)環(huán)倦零，其尾部連接到第一個(gè)節(jié)點(diǎn)误续。

示例 2

示例 3：
輸入：
head = [1], pos = -1
輸出：
false
解釋：
鏈表中沒有環(huán)。

示例 3

進(jìn)階：
你能用 O(1)（即扫茅，常量）內(nèi)存解決此問題嗎蹋嵌？

思路:

快慢指針
時(shí)間復(fù)雜度O(n), 空間復(fù)雜度O(1)

代碼:
C++:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution 
{
public:
    bool hasCycle(ListNode *head) 
    {
        ListNode *fast = head, *slow = head;
        while (fast and fast -> next) 
        {            
            fast = fast -> next -> next;
            slow = slow -> next;
            if (fast == slow) return true;
        }
        return false;
    }
};

Java:

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        ListNode fast = head, slow = head;
        while (fast != null && fast.next != null) {            
            fast = fast.next.next;
            slow = slow.next;
            if (fast == slow) return true;
        }
        return false;
    }
}

Python:

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution(object):
    def hasCycle(self, head: ListNode) -> ListNode:
        slow = fast = head
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
            if slow == fast:
                return True
        return False