C++實現LeetCode(141.單鏈表中的環)

Posted on by

[LeetCode] 141. Linked List Cycle 單鏈表中的環

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 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 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 3:

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

Follow up:

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

這道題是快慢指針的經典應用。隻需要設兩個指針，一個每次走一步的慢指針和一個每次走兩步的快指針，如果鏈表裡有環的話，兩個指針最終肯定會相遇。實在是太巧妙瞭，要是我肯定想不出來。代碼如下：

C++ 解法：

class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode *slow = head, *fast = head;
        while (fast && fast->next) {
            slow = slow->next;
            fast = fast->next->next;
            if (slow == fast) return true;
        }
        return false;
    }
};

Java 解法：

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

Github 同步地址：

https://github.com/grandyang/leetcode/issues/141

類似題目：

Linked List Cycle II

Happy Number

參考資料：

https://leetcode.com/problems/linked-list-cycle/

https://leetcode.com/problems/linked-list-cycle/discuss/44489/O(1)-Space-Solution

到此這篇關於C++實現LeetCode(141.單鏈表中的環)的文章就介紹到這瞭,更多相關C++實現單鏈表中的環內容請搜索WalkonNet以前的文章或繼續瀏覽下面的相關文章希望大傢以後多多支持WalkonNet！

推薦閱讀：