Leetcode-160. Intersection of Two Linked Lists

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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.

这个题解出来不难，关键是满足O（1）的空间复杂度 Your runtime beats 7.34% of java submissions.

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        Set<ListNode> visited = new HashSet<ListNode>();
        ListNode result = null;
        while(headA != null) {visited.add(headA); headA=headA.next;}
        while(headB != null) {if(visited.contains(headB)) return headB; headB = headB.next;}

        return result;
    }
}

看了下论坛，真是机智啊，循环判断一次即可得到结果。链接： 点击打开链接

Your runtime beats 15.09% of java submissions.

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if(headA == null || headB == null) return null;
        ListNode p1 = headA, p2 = headB;
        while(p1 != p2){
            
            p1 = p1.next;
            p2 = p2.next;
            if(p1 == p2) return p1;
            if(p1 == null) p1 = headB;
            if(p2 == null) p2 = headA;
        }
        return p1;
    }
}