Lintcode 380. Intersection of Two Linked Lists (Medium) (Python)

Intersection of Two Linked Lists

Description:

Write a program to find the node at which the intersection of two singly linked lists begins.

Example
The following two linked lists:

A: a1 → a2
↘
c1 → c2 → c3
↗
B: b1 → b2 → b3
begin to intersect at node c1.

Challenge
Your code should preferably run in O(n) time and use only O(1) memory.

Notice
If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.

Code:

"""
Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
"""


class Solution:
    """
    @param: headA: the first list
    @param: headB: the second list
    @return: a ListNode
    """
    def getIntersectionNode(self, headA, headB):
        # write your code here
        if not headA or not headB:
            return None
        l1, l2 = 0, 0
        hA, hB = ListNode(0), ListNode(0)
        hA.next = headA
        hB.next = headB

        cur = hA
        while cur.next:
            cur = cur.next
            l1 += 1

        cur = hB
        while cur.next:
            cur = cur.next
            l2 += 1

        if l1>l2:
            headA, headB = headB, headA
            l1, l2 = l2, l1
            hA, hB = hB, hA

        dif = l2-l1

        for i in range(dif):
            hB = hB.next


        while hA.next and hB.next:
            if hA.next == hB.next:
                return hA.next
            hA = hA.next
            hB = hB.next
        return None