Lintcode 102. Linked List Cycle (Easy) (Python)

最新推荐文章于 2018-09-30 17:57:18 发布

2Young2Simple

最新推荐文章于 2018-09-30 17:57:18 发布

阅读量130

点赞数

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/81323734

版权

Lintcode刷题专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Linked List Cycle

Description:

Given a linked list, determine if it has a cycle in it.

Example
Given -21->10->4->5, tail connects to node index 1, return true

Challenge
Follow up:
Can you solve it without using extra space?

Code:

"""
Definition of ListNode
class ListNode(object):

    def __init__(self, val, next=None):
        self.val = val
        self.next = next
"""


class Solution:
    """
    @param: head: The first node of linked list.
    @return: True if it has a cycle, or false
    """
    def hasCycle(self, head):
        # write your code here
        if not head:
            return False
        tmp = head
        while tmp.next:
            if tmp.next.val == None:
                return True
            tmp.val = None
            tmp = tmp.next
        return False