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) {
        if(headA==NULL || headB==NULL)
	{
		return  NULL;
	}

        ListNode* p1=headA;
	ListNode* p2=headB;

	int nLen1=0, nLen2=0;
	while(p1->next)
	{
		++nLen1;
		p1=p1->next;
	}
	while(p2->next)
	{
		++nLen2;
		p2=p2->next;
	}

	if(p1->val != p2->val)
	{
          return  NULL;
	}

	p1=headA;
	p2=headB;
	int nLen=max(nLen1, nLen2);
        if(nLen==nLen1)
	{
		int n=nLen-nLen2;
                while(n)
		{
			p1=p1->next;
			--n;
		}
	}

	if(nLen==nLen2)
	{
		int n=nLen-nLen1;
		while(n)
		{
			p2=p2->next;
			--n;
		}
	}

        while(p1 && p2)
	{
		if(p1->val != p2->val)
		{
		   p1=p1->next;
		   p2=p2->next;
		}
		else
		{
			return  p1;
		}
	}
        
    }
};