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

    你可能感兴趣的文章
    OpenLayers 入门使用
    查看>>
    Openlayers 入门教程(一):应该如何学习 Openlayers
    查看>>
    openlayers 入门教程(七):Interactions 篇
    查看>>
    openlayers 入门教程(三):view 篇
    查看>>
    openlayers 入门教程(九):overlay 篇
    查看>>
    openlayers 入门教程(二):map 篇
    查看>>
    openlayers 入门教程(五):sources 篇
    查看>>
    openlayers 入门教程(八):Geoms 篇
    查看>>
    openlayers 入门教程(十三):动画
    查看>>
    openlayers 入门教程(十二):定位与轨迹
    查看>>
    openlayers 入门教程(十五):与 canvas、echart,turf 等交互
    查看>>
    openlayers 入门教程(十四):第三方插件
    查看>>
    openlayers 入门教程(四):layers 篇
    查看>>
    OpenLayers 项目分析(三)-OpenLayers中定制JavaScript内置类
    查看>>
    Openlayers下载与加载geoserver的wms服务显示地图
    查看>>
    Openlayers中使用Cluster+Overlay实现点击单个要素和聚合要素时显示不同弹窗
    查看>>
    Openlayers中使用Cluster实现点位元素重合时动态聚合与取消聚合
    查看>>
    Openlayers中使用Cluster实现缩放地图时图层聚合与取消聚合
    查看>>
    Openlayers中使用Image的rotation实现车辆定位导航带转角(判断车辆图片旋转角度)
    查看>>
    Openlayers中加载Geoserver切割的EPSG:900913离线瓦片图层组
    查看>>