class Solution:
def FindFirstCommonNode(self, pHead1, pHead2):
p1 = []
node1 = pHead1
node2 = pHead2
while node1:
p1.append(node1.val)
node1 = node1.next
while node2:
if node2.val in p1:
return node2
else:
node2 = node2.next
剑指offer ---- 链表公共结点
最新推荐文章于 2020-11-10 20:47:22 发布