LeetCode 学习 LinkedList 专项（4）—— Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

合并两个有序的链表，并返回其作为一个新的链表。新链表的节点应该通过拼接前两个链表的节点而成。

---

public class mergeTwoLists {    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {        ListNode head = new ListNode(0);        ListNode l3 = head;        while (l1 != null && l2 != null) {            if (l1.val > l2.val) {                l3.next = l2;                l2 = l2.next;            }else {                l3.next = l1;                l1 = l1.next;            }            l3 = l3.next;        }        if(l2 == null){            l3.next = l1;        } else {            l3.next = l2;        }        return head.next;    }}