zoukankan      html  css  js  c++  java
  • LeetCode Linked List Easy 21. Merge Two Sorted Lists

     Description

    Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

    Example:

    Input: 1->2->4, 1->3->4
    Output: 1->1->2->3->4->4

     问题描述,将两个排序的链表归并

    代码:

    public ListNode MergeTwoLists(ListNode l1, ListNode l2) {
            ListNode ln1 = l1;
            ListNode ln2 = l2;
            ListNode res =new ListNode(0);
            ListNode temp = res;
            while(ln1 != null && ln2 != null){
                if(ln1.val < ln2.val){
                    temp.next = ln1;
                    ln1 =ln1.next;
                    temp = temp.next;
                }else{
                    temp.next = ln2;
                    ln2 =ln2.next;
                    temp = temp.next;
                }
            }
            while(ln1 != null){
                    temp.next = ln1;
                    ln1 =ln1.next;
                    temp = temp.next;            
            }
            while(ln2 != null){
                    temp.next = ln2;
                    ln2 =ln2.next;            
                    temp = temp.next;
            }
            return res.next;
        

  • 相关阅读:
    异常及throw、与throws的介绍
    js数组
    正则表达式
    Date对象及toString方法
    js中函数与对象的使用
    js细节
    JavaScript介绍
    浮动、定位
    css背景样式
    盒子模型
  • 原文地址:https://www.cnblogs.com/c-supreme/p/9610363.html
Copyright © 2011-2022 走看看