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

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) {
	    // 吴师兄
        if (pHead1 == null || pHead2 == null) return null;
        ListNode n1 = pHead1;
        ListNode n2 = pHead2;
        while( n1 != n2) {
            if(n1 == null) {
                n1 = pHead2;
            } else {
                n1 = n1.next;
            }
            if(n2 == null) {
                n2 = pHead1;
            } else {
                n2 = n2.next;
            }
        }
        return n1;
    }
}