class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode* l1 = headA;
ListNode* l2 = headB;
while(l1 != l2)
{
if(!l1) l1 = headB;
else l1 = l1->next;
if(!l2) l2 = headA;
else l2 = l2->next;
}
return l1;
}
};
leetcode每日一题第九十天
最新推荐文章于 2024-07-20 22:34:59 发布