标签:
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:
null
.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.
暴力算法 直接了当
对A链表每一个元素 遍历一遍B链表的元素 如果两个元素相等 则找出相交的链表
Intersection of Two Linked Lists
标签:
原文地址:http://www.cnblogs.com/anfly/p/4659267.html