/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode result = null;
if(l1 == null){
return l2;
}
if(l2 == null){
return l1;
}
if (l1.val <= l2.val){
result = l1;
l1.next = mergeTwoLists(l1.next, l2);
} else{
result = l2;
l2.next = mergeTwoLists(l1, l2.next);
}
return result;
}
}
21. 合并两个有序链表
最新推荐文章于 2024-05-04 09:47:06 发布