码迷,mamicode.com
首页 > 其他好文 > 详细

21. Merge Two Sorted Lists

时间:2017-10-25 15:21:41      阅读:98      评论:0      收藏:0      [点我收藏+]

标签:val   cin   ==   nbsp   first   span   color   should   div   

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.

含义:合并另个已经排好序的列表

 

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

 

21. Merge Two Sorted Lists

标签:val   cin   ==   nbsp   first   span   color   should   div   

原文地址:http://www.cnblogs.com/wzj4858/p/7728634.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!