力扣:21. 合并两个有序链表
This commit is contained in:
parent
1364be8654
commit
5f8039cdc8
@ -0,0 +1,21 @@
|
||||
package com.code.leet.study.t20210205;
|
||||
|
||||
import com.code.leet.entiy.ListNode;
|
||||
|
||||
public class MergeTwoLists {
|
||||
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;
|
||||
}
|
||||
}
|
||||
}
|
Loading…
Reference in New Issue
Block a user