160. Intersection of Two Linked Lists

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

For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3

begin to intersect at node c1.

Notes:

• 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.

• Your code should preferably run in O(n) time and use only O(1) memory.
• /**
   * 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) {
          int sizeA = get_size(headA);
          int sizeB = get_size(headB);
          if (sizeA >= sizeB) {
              int offset = sizeA - sizeB;
              for (int i = 0; i < offset; i++) {
                  headA = headA->next;
              }
              while (headA != NULL) {
                  if (headA == headB) {
                      return headA;
                  }
                  headA = headA->next;
                  headB = headB->next;
              }
          }
          if (sizeB >= sizeA) {
              int offset = sizeB - sizeA;
              for (int i = 0; i < offset; i++) {
                  headB = headB->next;
              }
              while (headB != NULL) {
                  if (headA == headB) {
                      return headA;
                  }
                  headA = headA->next;
                  headB = headB->next;
              }
          }
          return NULL;
      }
  private:
      int get_size(ListNode * node) {
          int size = 0;
          while (node != NULL) {
              size++;
              node = node->next;
          }
          return size;
      }
  };