算法之旅(相交链表160)

相交链表160

package com.leetcode.nine9M28d;

import java.util.HashSet;
import java.util.Set;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: Coderfine
 * @Date: 2023/09/28/11:28
 * @Description:
 */
public class 相交链表160 {
    public class ListNode {
        int val;
        ListNode next;

        ListNode(int x) {
            val = x;
            next = null;
        }
    }

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        //判断
        if (headA == null || headB == null) {
            return null;
        }
        //利用hash来存储如果放进去的空间如果now.next没有成功放进去，说明空间重复了，说了可以返回
        Set<ListNode> set = new HashSet<>();
        //定义头
        ListNode ListheadA = headA;
        ListNode ListheadB = headB;
        //先放
        while (ListheadA != null) {
            set.add(ListheadA);
            ListheadA = ListheadA.next;
        }
        //后判断
        while (ListheadB != null) {
            if (!set.add(ListheadB)) {
                return ListheadB;
            }
            ListheadB = ListheadB.next;
        }
        return null;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49