输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
思路:递归。先比较两个链表的头节点,然后递归调用比较后续节点。要注意先决条件。
/**
* 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) 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;
}
}
或者:伪头节点,先创建一个节点dum作为合并后链表的头节点,cur指针指向dum,循环判断l1和l2节点的大小,合并链表。
/**
* 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 dum = new ListNode(0), cur = dum; //伪头节点dum,cur指向dum
while (l1 != null && l2 != null){
if (l1.val < l2.val){
cur.next = l1;
l1 = l1.next;
}else{
cur.next = l2;
l2 = l2.next;
}
cur = cur.next;
}
cur.next = l1 != null ? l1 : l2;//跳出循环时l1或者l2还有一个剩余尾节点
return dum.next;
}
}
时间复杂度:O(M+N) 空间复杂度:O(1)