Python教程

环形链表python3(leetcode141)

本文主要是介绍环形链表python3(leetcode141),对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!

#141. 环形链表

 

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def hasCycle(self, head: ListNode) -> bool:
        #判断是否存在环,是leetcode142的前提条件
        slow, fast = head, head
        while(fast and fast.next):
            slow, fast = slow.next, fast.next.next
            if(slow == fast):
                return True
        else:
            return False

这篇关于环形链表python3(leetcode141)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!