Leetcode——160. 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.

不得不说，我没看懂英文题目。。可怕

我想到的，被称作暴力算法

哈希表：通常用于，两个东西，判断是否有重叠的部分，放里面就行

//正常解法，注意，最后有交叉的部分，一定是表明了交叉部分后面是全部相同的，，包括结点。和 长度。