class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
if not headA or not headB:return None
p1
Leetcode52 两个链表的第一个相交节点
最新推荐文章于 2022-08-25 09:04:33 发布
class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
if not headA or not headB:return None
p1