题目
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
代码
# 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):
"""
:type head: ListNode
:rtype: bool
"""
l1 = head
l2 = head
while l2 is not None:
if l2.next == l1:
return True
elif l2.next is None:
return False
l2 = l2.next.next
l1 = l1.next
return False
网友评论