zoukankan      html  css  js  c++  java
  • 141. Linked List Cycle

    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
            """
            if head==None:
                return False
            slow=head
            fast=head
            while fast.next!=None and fast.next.next!=None:
                slow=slow.next
                fast=fast.next.next
                if slow is fast: return True
            return False
  • 相关阅读:
    fidller 打断点
    随笔
    HTML标签介绍
    补充9.27----9.28
    html5_______9.26
    9.14
    9.13笔记
    9.12笔记
    CSS样式的引用
    html5_______9.10
  • 原文地址:https://www.cnblogs.com/rocksolid/p/6293008.html
Copyright © 2011-2022 走看看