[剑指offer] JAVA版题解 面试题25

在这里插入图片描述

代码演示:

package swordfingeroffer;

/**
 * create by
 *
 * @Author 罗志远
 * @on 2020-05-31.
 * @time 20:57
 */
public class InterviewQuestion25 {
    public static class ListNode {
        int value;
        ListNode next;

        public ListNode(int value) {
            this.value = value;
        }
    }
    public ListNode mergeList(ListNode list1, ListNode list2) {
        if (list1 == null) {
            return list2;
        }
        if (list2 == null) {
            return list1;
        }
        ListNode mergeListNode = null;
        ListNode mergeNode = mergeListNode;
        while (list1 != null || list2 != null) {
            if (list1 == null) {
                if (mergeNode == null) {
                    mergeNode = list2;
                } else {
                    mergeNode.next = list2;
                }
                if (mergeListNode == null) {
                    mergeListNode = mergeNode;
                }
                break;
            }
            if (list2 == null) {
                if (mergeNode == null) {
                    mergeNode = list1;
                } else {
                    mergeNode.next = list1;
                }
                if (mergeListNode == null) {
                    mergeListNode = mergeNode;
                }
                break;
            }
            ListNode tempNode = null;
            if (list1.value < list2.value) {
                tempNode = list1;
                list1 = list1.next;
                tempNode.next = null;
                if (mergeNode == null) {
                    mergeNode = tempNode;
                } else {
                    mergeNode.next = tempNode;
                    mergeNode = mergeNode.next;

                }
            } else {
                tempNode = list2;
                list2 = list2.next;
                tempNode.next = null;
                if (mergeNode == null) {
                    mergeNode = tempNode;
                } else {
                    mergeNode.next = tempNode;
                    mergeNode = mergeNode.next;

                }
            }
            if (mergeListNode == null) {
                mergeListNode = mergeNode;
            }
        }
        return mergeListNode;
    }

    public void printList(ListNode pHead) {
        if (pHead == null) {
            throw new RuntimeException("链表不能为空!");
        }
        ListNode temp = pHead;
        while (temp != null) {
            System.out.print(temp.value);
            temp = temp.next;
        }
    }

    public static void main(String[] args) {
        ListNode listNode1 = new ListNode(1);
        ListNode listNode2 = new ListNode(3);

        ListNode listNode3 = new ListNode(2);
        ListNode listNode4 = new ListNode(4);

        listNode1.next = listNode2;
        listNode3.next = listNode4;

        InterviewQuestion25 interviewQuestion25 = new InterviewQuestion25();
        ListNode resultList = interviewQuestion25.mergeList(listNode1,listNode3);
        interviewQuestion25.printList(resultList);
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值