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:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3

begin to intersect at node c1.

Notes:

• If the two linked lists have no intersection at all, return null.
• The linked lists must retain their original structure after the function returns.
• You may assume there are no cycles anywhere in the entire linked structure.
• Your code should preferably run in O(n) time and use only O(1) memory.

分析：

先遍历一个链表，用哈希表记录其节点的情况。遍历另一个链表，如果某个节点已经存在于哈希表中，则该节点就是要找的交叉节点。

Java代码实现：

/**
 * 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) {
        if(headA==null || headB==null)
            return null;
            
        HashMap<ListNode, Integer> h = new HashMap<ListNode, Integer>();
        ListNode node = headA;
        while(node!=null)
        {
            h.put(node, 1);
            node = node.next;
        }
        node = headB;
        while(node!=null)
        {
            if(h.containsKey(node))
                return node;
            node = node.next;
        }
        
        return null;
    }
}