首页 > 代码库 > Leetcode_num7_Linked List Cycle
Leetcode_num7_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: # def __init__(self, x): # self.val = x # self.next = None class Solution: # @param head, a ListNode # @return a boolean def hasCycle(self, head): if head==None: check=False else: check=True node=head while(node.val!=0): node.val=0 node=node.next if node==None: check=False break return check
Leetcode_num7_Linked List Cycle
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。