【Leetcode】21. Merge Two Sorted Lists

题目地址：

https://leetcode.com/problems/merge-two-sorted-lists/

合并两个有序链表。

代码如下：

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode dummy = new ListNode(0);
        ListNode cur = dummy;
        while (l1 != null || l2 != null) {
            if (l1 == null) {
                cur.next = l2;
                break;
            }
            if (l2 == null) {
                cur.next = l1;
                break;
            }
            
            if (l1.val <= l2.val) {
                cur.next = l1;
                l1 = l1.next;
            } else {
                cur.next = l2;
                l2 = l2.next;
            }
            cur = cur.next;
            
        }
        
        return dummy.next;
    }
}

class ListNode {
    int val;
    ListNode next;
    ListNode(int x) {
        val = x;
    }
}

时间复杂度$O(n_1+n_2)$，$n_i$是第$i$个链表的长度，空间$O(1)$。

C++：

class Solution {
 public:
  ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
    ListNode* dummy = new ListNode(0), *prev = dummy;
    while (l1 || l2) {
      if (!l1) {
        prev->next = l2;
        break;
      }
      if (!l2) {
        prev->next = l1;
        break;
      }
      if (l1->val <= l2->val) {
        prev->next = l1;
        l1 = l1->next;
      } else {
        prev->next = l2;
        l2 = l2->next;
      }
      prev = prev->next;
    }

    return dummy->next;
  }
};

时空复杂度一样。