首页 > 其他 > 详细

21. Merge Two Sorted Lists

时间:2017-09-25 21:40:11      阅读:237      评论:0      收藏:0      [点我收藏+]

21. Merge Two Sorted Lists

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

 

需要排序!!!

[2,4]
[1]

输出1 2 4

而不是2 4 1 

 

 递归版!!

 1 class Solution {
 2     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
 3         if(l1==null) return l2;
 4         if(l2==null) return l1;
 5         if(l1.val<l2.val) {
 6             l1.next = mergeTwoLists(l1.next,l2);
 7             return l1;
 8         }
 9         else {
10             l2.next = mergeTwoLists(l2.next,l1);
11             return l2;
12         }
13        
14     }
15     
16 }

 

21. Merge Two Sorted Lists

原文:http://www.cnblogs.com/zle1992/p/7593850.html

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