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

# 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 ):
        curA, curB = pHead1, pHead2
        while curA != curB:
            if curA == None:
                curA = pHead2;
            else:
                curA = curA.next;
            if curB == None:
                curB = pHead1;
            else:
                curB = curB.next;
        return curA;