首页 > 其他 > 详细

21. Merge Two Sorted Lists

时间:2016-09-09 00:30:36      阅读:170      评论: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.

 

Recursive:

  public ListNode MergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        if(l1.val<l2.val) 
        {
            l1.next =  MergeTwoLists(l1.next,l2);
            return l1;
        }
        else
        {
            l2.next = MergeTwoLists(l1,l2.next);
            return l2;
        }
    }

 

Iteration:

public ListNode MergeTwoLists(ListNode l1, ListNode l2) {
       if (l1 == null) return l2;
            if (l2 == null) return l1;
           
            var sentinel = new ListNode(-1);
            var dummy = sentinel;
            while(l1 != null && l2 != null)
            {
                if (l1.val < l2.val)
                {
                    sentinel.next = l1;
                    l1 = l1.next;
                }
                else
                {
                    sentinel.next = l2;
                    l2 = l2.next;
                }
                sentinel = sentinel.next;
            }
            if (l1 != null) sentinel.next = l1;
            else sentinel.next = l2;
            return dummy.next;
    }

 

21. Merge Two Sorted Lists

原文:http://www.cnblogs.com/renyualbert/p/5854939.html

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