算法通关村第一关---链表经典问题之两个链表的第一个公共节点笔记

最新推荐文章于 2024-06-12 16:51:14 发布

Enndfp

最新推荐文章于 2024-06-12 16:51:14 发布

阅读量1.4k

点赞数 1

文章标签：笔记链表算法 java

本文链接：https://blog.csdn.net/Enndfp/article/details/131762266

版权

源码地址：GitHub-算法通关村

1.hash

/**
     * 方法1  通过hash辅助查找
     *
     * @param headA
     * @param headB
     * @return
     */
    public static ListNode FindFirstCommonNodeByMap(ListNode headA, ListNode headB) {
        if (headA == null || headB == null) {
            return null;
        }
        Map<ListNode, Integer> map = new HashMap<>();
        while (headA != null) {
            map.put(headA, null);
            headA = headA.next;
        }
        while (headB != null) {
            if (map.containsKey(headB)) {
                return headB;
            }
            headB = headB.next;
        }
        return null;
    }

2.集合

/**
     * 方法2  通过集合辅助查找
     *
     * @param headA
     * @param headB
     * @return
     */
    public static ListNode FindFirstCommonNodeBySet(ListNode headA, ListNode headB) {
        if (headA == null || headB == null) {
            return null;
        }
        Set<ListNode> set = new HashSet<>();
        while (headA != null) {
            set.add(headA);
            headA = headA.next;
        }
        while (headB != null) {
            if (set.contains(headB)) {
                return headB;
            }
            headB = headB.next;
        }
        return null;
    }

3.栈

/**
     * 方法3  通过栈来辅助查找
     *
     * @param headA
     * @param headB
     * @return
     */
    public static ListNode findFirstCommonNodeByStack(ListNode headA, ListNode headB) {
        if (headA == null || headB == null) {
            return null;
        }
        Stack<ListNode> stackA = new Stack<>();
        Stack<ListNode> stackB = new Stack<>();

        while (headA != null) {
            stackA.push(headA);
            headA = headA.next;
        }
        while (headB != null) {
            stackB.push(headB);
            headB = headB.next;
        }

        ListNode pNode = null;
        while (stackA.size() > 0 && stackB.size() > 0) {
            if (stackA.peek() == stackB.peek()) {
                pNode = stackA.pop();
                stackB.pop();
            } else {
                break;
            }
        }
        return pNode;
    }

4.双指针

/**
     * 方法4  通过双指针来辅助查找
     *
     * @param headA
     * @param headB
     * @return
     */
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if (headA == null || headB == null) {
            return null;
        }

        ListNode ptrA = headA;
        ListNode ptrB = headB;

        while (ptrA != ptrB) {
            ptrA = ptrA == null ? headB : ptrA.next;
            ptrB = ptrB == null ? headA : ptrB.next;
        }

        return ptrA;
    }