funchasCycle(head *ListNode)bool{var fast = head
var slow = head
for{if fast ==nil|| fast.Next ==nil{returnfalse}
fast = fast.Next.Next
slow = slow.Next
if slow == fast{break}}returntrue}
描述给定一个链表,判断链表中是否有环。思路一快一慢的双指针, 如果快的能追上满的 说明时环形链表实现func hasCycle(head *ListNode) bool { if head == nil || head.Next == nil{ return false } var fast = head.Next var slow = head for slow...