环形链表python3(leetcode141)
2021/12/14 11:46:43
本文主要是介绍环形链表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)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-03-30开始python成长之路
- 2024-03-29python optparse
- 2024-03-29python map 函数
- 2024-03-20invalid format specifier python
- 2024-03-18pool.map python
- 2024-03-18threads in python
- 2024-03-14python Ai 应用开发基础训练,字符串,字典,文件
- 2024-03-13id3 algorithm python
- 2024-03-13sum array elements python
- 2024-03-12python colon equals