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

    你可能感兴趣的文章
    object detection错误之Could not create cudnn handle: CUDNN_STATUS_INTERNAL_ERROR
    查看>>
    object detection错误之no module named nets
    查看>>
    Object of type 'ndarray' is not JSON serializable
    查看>>
    Object Oriented Programming in JavaScript
    查看>>
    object references an unsaved transient instance - save the transient instance before flushing
    查看>>
    Object 类的常见方法有哪些?
    查看>>
    Object-c动态特性
    查看>>
    Object.assign用法
    查看>>
    Object.create
    查看>>
    Object.defineProperty详解
    查看>>
    Object.keys()的详解和用法
    查看>>
    objectForKey与valueForKey在NSDictionary中的差异
    查看>>
    Objective - C 小谈:消息机制的原理与使用
    查看>>
    OBJECTIVE C (XCODE) 绘图功能简介(转载)
    查看>>
    Objective-C ---JSON 解析 和 KVC
    查看>>
    Objective-C 编码规范
    查看>>
    Objective-Cfor循环实现Factorial阶乘算法 (附完整源码)
    查看>>
    Objective-C——判断对象等同性
    查看>>
    objective-c中的内存管理
    查看>>
    Objective-C之成魔之路【7-类、对象和方法】
    查看>>