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

import java.util.*;
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        ListNode p1 = pHead1, p2 = pHead2;
        while (p1 != p2) {
            if (p1 == null)
                p1 = pHead2;
            else
                p1 = p1.next;
            if (p2 == null)
                p2 = pHead1;
            else
                p2 = p2.next;
        }
        return p1;
    }
}