https://leetcode-cn.com/problems/intersection-of-two-linked-lists/
从LeetCode上搜一下,这是一道很浪漫的题目哈哈
原理:
a+c+b+c=
b+c+a+c
所以重复部分就可以找到了
/**
* 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;
}
ListNode node = headA;
ListNode node2 = headB;
while(node != node2){
node=node!=null?node.next:headB;
node2=node2!=null?node2.next:headA;
}
return node;
}
}