?題目：判斷鏈表是否有環

//環形鏈表//哈希表 func hasCycle(head *ListNode) bool {seen := map[*ListNode]struct{}{}for head != nil {if _, ok := seen[head]; ok {return true}//標記該節點已被訪問seen[head] = struct{}{}head = head.Next}return false }//快慢指針 func hasCycle(head *ListNode) bool {if head == nil || head.Next == nil {return false}slow, fast := head, head.Nextfor fast != slow {if fast == nil || fast.Next == nil {return false}//慢指針一次移動2步slow = slow.Next//快指針一次移動2步fast = fast.Next.Next}return true }

鏈接：https://leetcode-cn.com/problems/linked-list-cycle/solution/huan-xing-lian-biao-by-leetcode-solution/

總結

以上是生活随笔為你收集整理的算法：环形链表的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。