两个链表合成需要注意的问题

1: 注意有两个链表cur1, cur2, 将cur1.next=cur2; 如果两个链表结合到一起会形成环状, 则会改变cur2, 使cur2成为一个环.

例子1

public class Test02 {
    public static class ListNode{
        public int value;
        public ListNode next;
        public ListNode(int value){
            this.value = value;
        }
    }
    public static ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        ListNode curA1 = headA;
        ListNode curA2 = headA;

        //测试headA之前输出什么
        System.out.print("headA操作之前:");
        while (curA1!=null){
            System.out.print(curA1.value+",");
            curA1 = curA1.next;
        }
        System.out.println("\n");

        ListNode curB1 = headB;
        ListNode curB2 = headB;

        //测试headB之前输出什么
        System.out.print("headB操作之前:");
        while (curB1!=null){
            System.out.print(curB1.value+",");
            curB1 = curB1.next;
        }
        System.out.println("\n");

        //将headA补充到headB上
        while(headA.next!=null){
            headA = headA.next;
        }
        headA.next = headB;

        //测试headA操作之后会输出什么
        System.out.print("headA操作之后:");
        for (int i = 0; i < 10; i++) {
            System.out.print(curA2.value+",");
            curA2 = curA2.next;
        }
        System.out.println("\n");

        //测试将headB添加到headA的末尾, headB会发生变化吗?  结果是"会"!
        System.out.print("headB操作之后:");
        for (int i = 0; i < 10; i++) {
            System.out.print(curB2.value+",");
            curB2 = curB2.next;
        }
        return null;
    }

    public static void main(String[] args) {
        ListNode listNode1 = new ListNode(1);
        ListNode listNode2 = new ListNode(2);
        ListNode listNode3 = new ListNode(3);
        ListNode listNode4 = new ListNode(4);
        ListNode listNode5 = new ListNode(5);
        listNode1.next = listNode2;
        listNode2.next = listNode3;
        listNode3.next = listNode4;
        listNode4.next = listNode5;
        ListNode listNode6 = new ListNode(6);
        listNode6.next = listNode4;
        ListNode result = Test02.getIntersectionNode(listNode1, listNode6);
    }
}

控制台输出 

2: 如果两个链表合成并不会形成环状, 则并不会改变cur2链表的结构

public class Test02 {
    public static class ListNode{
        public int value;
        public ListNode next;
        public ListNode(int value){
            this.value = value;
        }
    }
    public static ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        ListNode curA1 = headA;
        ListNode curA2 = headA;

        //测试headA之前输出什么
        System.out.print("headA操作之前:");
        while (curA1!=null){
            System.out.print(curA1.value+",");
            curA1 = curA1.next;
        }
        System.out.println("\n");

        ListNode curB1 = headB;
        ListNode curB2 = headB;

        //测试headB之前输出什么
        System.out.print("headB操作之前:");
        while (curB1!=null){
            System.out.print(curB1.value+",");
            curB1 = curB1.next;
        }
        System.out.println("\n");

        //将headA补充到headB上
        while(headA.next!=null){
            headA = headA.next;
        }
        headA.next = headB;

        //测试headA操作之后会输出什么
        System.out.print("headA操作之后:");
        for (int i = 0; i < 10; i++) {
            System.out.print(curA2.value+",");
            curA2 = curA2.next;
        }
        System.out.println("\n");

        //测试将headB添加到headA的末尾, headB会发生变化吗?  结果是"会"!
        System.out.print("headB操作之后:");
        while (curB2!=null){
            System.out.print(curB2.value+",");
            curB2 = curB2.next;
        }
        return null;
    }

    public static void main(String[] args) {
        ListNode listNode1 = new ListNode(1);
        ListNode listNode2 = new ListNode(2);
        ListNode listNode3 = new ListNode(3);
        ListNode listNode4 = new ListNode(4);
        ListNode listNode5 = new ListNode(5);
        listNode1.next = listNode2;
        listNode2.next = listNode3;
        listNode3.next = listNode4;
        listNode4.next = listNode5;
        ListNode listNode6 = new ListNode(6);
        ListNode listNode7 = new ListNode(7);
        ListNode listNode8 = new ListNode(8);
        ListNode listNode9 = new ListNode(9);
        ListNode listNode10 = new ListNode(10);
        listNode6.next = listNode7;
        listNode7.next = listNode8;
        listNode8.next = listNode9;
        listNode9.next = listNode10;
        ListNode result = Test02.getIntersectionNode(listNode1, listNode6);
    }
}

控制台输出