博客
关于我
[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/

    你可能感兴趣的文章
    NISP一级,NISP二级报考说明,零基础入门到精通,收藏这篇就够了
    查看>>
    NI笔试——大数加法
    查看>>
    NLP 基于kashgari和BERT实现中文命名实体识别(NER)
    查看>>
    NMAP网络扫描工具的安装与使用
    查看>>
    NN&DL4.3 Getting your matrix dimensions right
    查看>>
    NN&DL4.8 What does this have to do with the brain?
    查看>>
    No 'Access-Control-Allow-Origin' header is present on the requested resource.
    查看>>
    No fallbackFactory instance of type class com.ruoyi---SpringCloud Alibaba_若依微服务框架改造---工作笔记005
    查看>>
    No module named cv2
    查看>>
    No module named tensorboard.main在安装tensorboardX的时候遇到的问题
    查看>>
    No qualifying bean of type XXX found for dependency XXX.
    查看>>
    No resource identifier found for attribute 'srcCompat' in package的解决办法
    查看>>
    Node.js 文件系统的各种用法和常见场景
    查看>>
    node.js 配置首页打开页面
    查看>>
    node.js+react写的一个登录注册 demo测试
    查看>>
    Node.js安装与配置指南:轻松启航您的JavaScript服务器之旅
    查看>>
    nodejs libararies
    查看>>
    nodejs-mime类型
    查看>>
    nodejs中Express 路由统一设置缓存的小技巧
    查看>>
    Node入门之创建第一个HelloNode
    查看>>