160. 相交链表

 lenA, lenB = 0, 0
        pA = headA
        pB = headB
        while pA:
            pA = pA.next
            lenA += 1
        while pB:
            pB = pB.next
            lenB += 1
        pA = headA
        pB = headB
        if lenA > lenB:
            for i in range(lenA-lenB):
                pA = pA.next
        else:
            for i in range(lenB-lenA):
                pB = pB.next
        while pA!=pB:
            pA = pA.next
            pB = pB.next
        return pA

首先我知道怎么吧代码变成彩色了，
1.链表的结构如下，主要点在于链表类的长度要自己遍历出来。然后链表的相等和链表值的相等的区分。pa=pb而不是pa.next=pb.next

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