LeetCode 160. Intersection of Two Linked Lists

分析

难度 易
来源
https://leetcode.com/problems/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.

解答

package LeetCode;

public class L160_IntersectionOfTwoLinkedLists {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if(headA==null||headB==null)
            return null;
        ListNode temp=headA;
        while(temp.next!=null)
        {
            temp=temp.next;
        }
        temp.next=headB;
        ListNode fast=headA;
        ListNode slow=headA;
        while( fast!=null&&fast.next!=null){
            fast=fast.next.next;
            slow=slow.next;
            if(slow==fast){
                ListNode slow2=headA;
                while(slow2!=slow){
                    slow=slow.next;
                    slow2=slow2.next;
                }
                temp.next=null;//恢复原链表结构
                return slow2;
            }
        }
        temp.next=null;
        return null;
    }
}