原题目:https://leetcode-cn.com/problems/intersection-of-two-linked-lists-lcci/
思路:
按引用相等,可以使用=判别。
代码:
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode* p,*q;
p = headA,q=headB;
while(p!=q){
p = p? p->next:headB;
q = q? q->next:headA;
}
return p;
}
};