![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
快慢指针
princey2100
这个作者很懒,什么都没留下…
展开
-
Leetcode 142. 环形链表 II Linked List Cycle II - Python 双指针法
# 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, head #让快慢指针.原创 2022-12-06 22:57:02 · 311 阅读 · 0 评论 -
Leetcode 面试题 02.07. 链表相交 Intersection of Two Linked Lists LCCI - Python 双指针法
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode: curA, curB =.原创 2022-02-24 22:19:19 · 166 阅读 · 0 评论 -
Leetcode 19.删除链表的倒数第 N 个结点 Remove Nth Node From End of List - Python 双指针法Vs笨蛋法
笨蛋法# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def removeNthFromEnd(self, head: ListNode, n: int) : size = 1 c原创 2022-02-24 17:11:36 · 58 阅读 · 0 评论