/**
* 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) {
if(l1 == null && l2 == null){
return null;
}
if(l1 == null){
return l2;
}
if(l2 == null){
return l1;
}
ListNode head = null;
if(l1.val < l2.val){
head = l1;
head.next = mergeTwoLists(l1.next, l2);
} else{
head = l2;
head.next = mergeTwoLists(l1, l2.next);
}
return head;
}
}
LeetCode21-合并两个有序链表
最新推荐文章于 2024-11-08 23:31:31 发布