双子叶mm的博客

题解：# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def detectCycle(self, head: ListNode) -> ListNode: fast = slow = head ...

题解：# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def hasCycle(self, head: ListNode) -> bool: fast = slow = head while...

题解：class Solution: def deleteDuplicates(self, head: ListNode) -> ListNode: if head == None: return None slow = fast = head # 如果快指针没有走到链表尾部节点之后，则一直循环 while fast != None: if fast.val != s...