leetcode Intersection of Two Linked Lists题解

题目描述：

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

begin to intersect at node c1.

 

Example 1:

Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.

中文理解：给出两个链表，判断两个链表是否具有交点。

解题思路：首先遍历链表headA，使用hashset来存储存储所有节点，遍历链表headB，若某一个节点在hashset中，则返回该节点，否则返回null。

代码（java）：

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        HashSet<ListNode> hset=new HashSet<ListNode>();
        while(headA!=null){
            hset.add(headA);
            headA=headA.next;
        }
        while(headB!=null){
            if(hset.contains(headB))return headB;
            headB=headB.next;
        }
        return null;
    }
}