输入两个链表，找出它们的第一个公共结点。（注意因为传入数据是链表，

最新推荐文章于 2022-05-31 20:07:52 发布

杨树叶子0526

最新推荐文章于 2022-05-31 20:07:52 发布

阅读量242

点赞数

分类专栏： java测试

本文链接：https://blog.csdn.net/qq_38360823/article/details/111314874

版权

java测试专栏收录该内容

2 篇文章 0 订阅

订阅专栏

注意： ListNode a1与b1的子节点

public class JavaDemoTest {

    public static void main(String[] args) {
        ListNode a1 = new ListNode(7);
        ListNode b1 = new ListNode(6);

        ListNode a2 = new ListNode(1);
        ListNode a3 = new ListNode(3);
        a1.next = a2;
        a2.next = a3;
        b1.next=a2;
        System.out.println(FindFirstCommonNode(a1, b1));

    }
    public static ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        if (pHead1 != null && pHead2 != null) {
            ListNode pHead2Temp = pHead2;
            while (pHead1 != null) {
                while (pHead2 != null) {
                    if (pHead1 == pHead2) {
                        return pHead1;
                    }
                    pHead2 = pHead2.next;
                }
                pHead2 =pHead2Temp;
                pHead1 = pHead1.next;
            }
        }
        return null;
    }
}