public class Solution {
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;
}
}
}
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Description Merge two sorted l...
**21. Merge Two Sorted Lists **Merge two sorted linked li...
D121 21. Merge Two Sorted Lists 题目链接 21. Merge Two Sorted...
021 Merge two sorted lists Merge two sorted linked lists ...
LeetCode 21.Merge Two Sorted Lists Merge two sorted linke...
题目比较简单： Merge Two Sorted Lists Merge two sorted linked l...
本文标题：21. Merge Two Sorted Lists
本文链接：https://www.haomeiwen.com/subject/ukcmmttx.html
网友评论