ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { //好方法
ListNode *ptr1 = headA, *ptr2 = headB;
while(ptr1 != ptr2){
ptr1 = ptr1?ptr1->next:headB;
ptr2 = ptr2?ptr2->next:headA;
}
return ptr1;
}
160. Intersection of Two Linked Lists
最新推荐文章于 2020-10-03 20:16:42 发布