无环链表相交 解法太复杂 #6

Activity

1. zqiang3 commented on Jun 1, 2019

   

   zqiang3

   on Jun 1, 2019

   Last edited by zqiang3

   Author

   More actions

   class Solution(object):
       def getIntersectionNode(self, headA, headB):   
                   
           cura, curb = headA, headB
           
           while cura is not curb:
               cura = cura.next if cura else headB
               curb = curb.next if curb else headA
                                   
           return cura