题解 | #两个链表的第一个公共结点#

public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        // 定义两个指针
        ListNode p1 = pHead1;
        ListNode p2 = pHead2;
        //当p1 == p2时结束
        while(p1 != p2){
          	//p1先遍历 pHead1,然后开始遍历pHead2
            p1 = p1 != null ?p1.next:pHead2;
          	//p2先遍历 pHead2,然后开始遍历pHead1
            p2 = p2 != null ?p2.next:pHead1;
        }
        
        return p1;
 
    }
}