明天回家喽,最近在学习的瓶颈期,感觉学的东西好难,有厌学的心理,但是我相信过了这段煎熬的时期,就好了。
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
int na = 0, nb = 0;
ListNode* tempA = headA;
ListNode* tempB = headB;
while(tempA){
++na;
tempA = tempA->next;
}
while(tempB){
++nb;
tempB = tempB->next;
}
int n = na- nb;
if(nb > na){
tempA = headB;
tempB = headA;
n = nb - na;
}else{
tempA = headA;
tempB = headB;
}
while(n){
tempA = tempA->next;
--n;
}
while(tempA){
if(tempA == tempB) return tempA;
tempA = tempA->next;
tempB = tempB->next;
}
return NULL;
}
};
标签:tempB,tempA,ListNode,na,02.07,面试题,next,链表,nb From: https://www.cnblogs.com/llllmz/p/18438453