剑指offer算法题：两个链表的第一个公共结点FindFirstCommonNode

输入两个链表，找出它们的第一个公共结点。（注意因为传入数据是链表，所以错误测试数据的提示是用其他方式显示的，保证传入数据是正确的）

1.从链表头判断，长链表先走，直至两个链表持平。

public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
         if(pHead1 == null || pHead2 == null)
             return null;
         int len1=0,len2=0;
         ListNode n1 = pHead1,n2 = pHead2;
         while(n1 != null || n2 != null) {
            if(n1 != null){
                len1++;
                n1 = n1.next;
            }
            if(n2 != null) {
                len2++;
                n2 = n2.next;
            }
        }
        int distance = Math.abs(len1 - len2);
        while(pHead1 != null || pHead2 != null) {
            while(distance-- > 0) {
                if(len1 > len2) {
                    pHead1 = pHead1.next;
                }else{
                    pHead2 = pHead2.next;
                }
            }
            if(pHead1 == pHead2) {
                return pHead1;
            }else {
                pHead1 = pHead1.next;
                pHead2 = pHead2.next;
            }
        }
        return null;
    }
}

2HashMap

import java.util.HashMap;
/*
public class ListNode {
    int val;
    ListNode next = null;
 
    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
         HashMap<ListNode,Integer> map = new HashMap<>();
         ListNode p1 = pHead1;
         while(p1 != null) {
             map.put(p1,1);
             p1 = p1.next;
         }
         while(pHead2 != null) {
             if(map.containsKey(pHead2))
                 return pHead2;
             pHead2 = pHead2.next;
         }
        return null;
    }
}

3. 定义两个栈，利用先进后出的结构从链表尾判断。