题解 | #两个链表的第一个公共结点#

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

#
# 
# @param pHead1 ListNode类 
# @param pHead2 ListNode类 
# @return ListNode类
#
class Solution:
    def FindFirstCommonNode(self , pHead1 , pHead2 ):
        # write code here
        if not pHead1 or not pHead2:
            return None

        p1 = []
        p2 = []
        res = None
        while pHead1:
            p1.append(pHead1)
            pHead1=pHead1.next

        while pHead2:
            p2.append(pHead2)
            pHead2=pHead2.next
        
        while (p1 and p2):
            tmp1 = p1.pop()
            tmp2 = p2.pop()
            if (tmp1 != tmp2):
                return res
            else:
                res = tmp1
            
        return res

Notes:

此题输出为第一个公共结点，不是结点的值。

ref:

https://blog.csdn.net/wszll_Alex/article/details/86648731