博客
关于我
[2021校招必看之Java版《剑指offer》-16] 合并两个排序的链表
阅读量:109 次
发布时间:2019-02-26

本文共 2374 字,大约阅读时间需要 7 分钟。

??????????

????

  • ????
  • ????
    2.1 ???
    2.2 ???
  • ????
    3.1 ???
    3.2 ???
  • ????
  • ????

    ??????????????????????????????????????

    ??????????
    ????

    ????

    ???
  • ?????
    • ??????????? head?????????? index1 ? index2?
    • ???????? temp ????????
    • ?? index1 ? index2 ????????????????????????
    • ?????????????????????????????
  • ???
  • ?????
    • ?????????????????????????
    • ??????????????????????????
    • ????????????????????????????????
  • ????

    ?????
    package pers.klb.jzoffer.medium;public class MergeList {    public ListNode Merge(ListNode list1, ListNode list2) {        if (list1 == null) {            return list2;        } else if (list2 == null) {            return list1;        }                ListNode head = new ListNode(0);        ListNode temp = head;        ListNode index1 = list1;        ListNode index2 = list2;                while (true) {            if (index1.val <= index2.val) {                temp.next = index1;                index1 = index1.next;                temp = temp.next;                                if (index1 == null) {                    temp.next = index2;                    break;                }            } else {                temp.next = index2;                index2 = index2.next;                temp = temp.next;                                if (index2 == null) {                    temp.next = index1;                    break;                }            }        }                return head.next;    }        public class ListNode {        public int val;        public ListNode next = null;        public ListNode(int val) {            this.val = val;        }    }}
    ?????
    package pers.klb.jzoffer.medium;public class MergeList {    public ListNode Merge(ListNode list1, ListNode list2) {        if (list1 == null) {            return list2;        } else if (list2 == null) {            return list1;        } else {            if (list1.val <= list2.val) {                list1.next = Merge(list1.next, list2);                return list1;            } else {                list2.next = Merge(list1, list2.next);                return list2;            }        }    }        public class ListNode {        public int val;        public ListNode next = null;        public ListNode(int val) {            this.val = val;        }    }}

    ????

    ?????????????????????????????

    • ????????????????????????????
    • ??????????????????????????
      ???????????????????????????????????????????

    转载地址:http://ubok.baihongyu.com/

    你可能感兴趣的文章
    No module named ‘MySQLdb‘错误解决No module named ‘MySQLdb‘错误解决
    查看>>
    No new migrations found. Your system is up-to-date.
    查看>>
    No qualifying bean of type XXX found for dependency XXX.
    查看>>
    No resource identifier found for attribute 'srcCompat' in package的解决办法
    查看>>
    no session found for current thread
    查看>>
    No toolchains found in the NDK toolchains folder for ABI with prefix: mips64el-linux-android
    查看>>
    NO.23 ZenTaoPHP目录结构
    查看>>
    NO32 网络层次及OSI7层模型--TCP三次握手四次断开--子网划分
    查看>>
    NoClassDefFoundError: org/springframework/boot/context/properties/ConfigurationBeanFactoryMetadata
    查看>>
    Node JS: < 一> 初识Node JS
    查看>>
    Node-RED中使用JSON数据建立web网站
    查看>>
    Node-RED中使用json节点解析JSON数据
    查看>>
    Node-RED中使用node-random节点来实现随机数在折线图中显示
    查看>>
    Node-RED中使用node-red-browser-utils节点实现选择Windows操作系统中的文件并实现图片预览
    查看>>
    Node-RED中使用Notification元件显示警告讯息框(温度过高提示)
    查看>>
    Node-RED中实现HTML表单提交和获取提交的内容
    查看>>
    Node.js 8 中的 util.promisify的详解
    查看>>
    Node.js 函数是什么样的?
    查看>>
    Node.js 历史
    查看>>
    Node.js 在个推的微服务实践:基于容器的一站式命令行工具链
    查看>>