合并两个有序链表

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例：

输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode newHead = new ListNode(-1); //设置一个虚拟节点,串合并之后的链表
        ListNode tmp = newHead; //tmp指向 newHead
        while (l1 != null && l2 != null){
            if (l1.val <l2.val){
                //串A
                tmp.next = l1;
                tmp = tmp.next;
                l1 = l1.next;
            }else {
                //串B
                tmp.next = l2;
                tmp = tmp.next;
                l2 = l2.next;
            }
        }
        if (l1 != null){
            tmp.next = l1;
        }else {
            tmp.next = l2;
        }
        return newHead.next;
    }
}