力扣-160题（Java）一道很浪漫的题目

题目链接：https://leetcode-cn.com/problems/intersection-of-two-linked-lists/
题目如下：

/**
 * 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) {
        HashSet<ListNode> hash=new HashSet<ListNode>();
        while(headA!=null){
            hash.add(headA);
            headA=headA.next;
        }

        while(headB!=null){
            if(hash.contains(headB)) {
                ListNode cur=headB;
                while(hash.contains(headB)==true&&headB!=null)
                    headB=headB.next;
                if(headB==null) return cur;
            }           
            headB=headB.next;
        }
        return null;
    }
}