【LeetCode】160. Intersection of Two Linked Lists 相交链表（Easy）（JAVA）

【LeetCode】160. Intersection of Two Linked Lists 相交链表（Easy）（JAVA）

题目地址: 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:

begin to intersect at node c1.

Example 1:

Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,6,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.

Example 2:

Input: intersectVal = 2, listA = [1,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
Output: Reference of the node with value = 2
Input Explanation: The intersected node's value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [1,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.

Example 3:

Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
Output: null
Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
Explanation: The two lists do not intersect, so return null.

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.
• Each value on each linked list is in the range [1, 10^9].
• Your code should preferably run in O(n) time and use only O(1) memory.

题目大意

编写一个程序，找到两个单链表相交的起始节点。

• 如果两个链表没有交点，返回 null.
• 在返回结果后，两个链表仍须保持原有的结构。
• 可假定整个链表结构中没有循环。
• 程序尽量满足 O(n) 时间复杂度，且仅用 O(1) 内存。

解题方法

1. 如果两个链表有交点，那么交点后的元素是一模一样的，所以交点后的长度也是一样的
2. 计算出两个链表的长度 lenA 和 lenB，让长度长的先走 Math.abs(lenA - lenB)，然后不断往后遍历，判断元素是否相同
3. note: 因为这道题目已经指明了没有环才可以计算出长度

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        int lenA = getLen(headA);
        int lenB = getLen(headB);
        if (lenA > lenB) {
            int temp = lenA;
            lenA = lenB;
            lenB = temp;
            ListNode tempHead = headA;
            headA = headB;
            headB = tempHead;
        }
        for (int i = 0; i < lenB - lenA; i++) {
            headB = headB.next;
        }
        while (headA != null) {
            if (headA == headB) return headA;
            headA = headA.next;
            headB = headB.next;
        }
        return null;
    }
    
    public int getLen(ListNode head) {
        int res = 0;
        while (head != null) {
            head = head.next;
            res++;
        }
        return res;
    }
}

执行耗时:1 ms,击败了99.99% 的Java用户
内存消耗:40.9 MB,击败了96.56% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新