intersection-of-two-linked-lists.cpp

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode *curr1 = headA, *curr2 = headB;
        while (curr1 != curr2) {
            if (curr1 == NULL) {
                curr1 = headB;
            }
            else {
                curr1 = curr1->next;
            }
            if (curr2 == NULL) {
                curr2 = headA;
            }
            else {
                curr2 = curr2->next;
            }
        }
        return curr1;
    }
};