两个指针同时行走,当到链表尾部就跳到另一个链表头部,当两个指针相遇时停止
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
ListNode p1=headA, p2=headB;
while(p1!=p2){
if(p1 == null){ //不要写成p1.next == null,不能应对无公共节点的情况,这样写能返回null
p1 = headB;
}else{
p1 = p1.next;
}
if(p2 == null) {
p2 = headA;
}else{
p2 = p2.next;
}
}
return p1;
}
}