输入两个链表,找出它们的第一个公共节点
/** * Definition for singly-linked list.
* struct ListNode
* {
* * int val;
* * struct ListNode *next;
* * };
* */
* struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB)
* {
* struct ListNode *headA_1 = headA;
* struct ListNode *headB_1 = headB;
* while(headA_1 != headB_1)
* {
* headA_1 = headA_1 == NULL?headA:headA_1->next;
* headB_1 = headB_1 == NULL?headB:headB_1->next;
* }
* return headB_1;
* }