ListNode* getIntersectionNode(ListNode* headA, ListNode* headB)
{
ListNode* A = headA;
ListNode* B = headB;
while (A != B)
{
if (A == NULL)
A = headB;
else
{
A = A->next;
}
if (B == NULL)
B = headA;
else
{
B = B->next;
}
}
return A;
}