首页 > 其他 > 详细

LeetCode-21.Merge Two Sorted Lists

时间:2019-02-25 10:12:34      阅读:128      评论:0      收藏:0      [点我收藏+]

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) {//链表 my
        ListNode node = new ListNode(0);
        ListNode curr= node;
        while(null!=l1&&null!=l2){
            if(l1.val<l2.val){
                curr.next=l1;
                l1=l1.next;
                curr=curr.next;
                curr.next=null;
            }
            else{
                curr.next=l2;
                l2=l2.next;
                curr=curr.next;
                curr.next=null;
            }
        }
        if (null!=l1){
            curr.next=l1;
        }
        else{
            curr.next=l2;
        }
        return node.next;
    }

  

LeetCode-21.Merge Two Sorted Lists

原文:https://www.cnblogs.com/zhacai/p/10429234.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!