struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB)
{
struct ListNode *A = headA;
struct ListNode *B = headB;
//当为空链表时
if(A==NULL || B==NULL)
{
return NULL;
}
while(A!=B)
{
if(A!=NULL)
A = A->next;
else
A = headB;//当A链表遍历完后指向B链表
if(B!=NULL)
B = B->next;
else
B = headA;//当B链表遍历完后指向A链表
}
//循环结束后表示A与B相遇,指向同一块空间,则返回任意即可
return A;
}