Leetcode(Java)-21. 合并两个有序链表

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

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

/**
 * 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 sentinel = new ListNode(0);
        ListNode curr =sentinel;
        while(l1!=null || l2!=null){
            if(l1==null)
            {
                curr.next = l2;
                curr = l2;
                l2=l2.next;
                continue;
            }
            if(l2==null)
            {
                curr.next = l1;
                curr = l1;
                l1=l1.next;
                continue;
            }

            if(l1.val < l2.val)
            {
                curr.next = l1;
                curr = l1;
                l1=l1.next;
            }
            else
            {
                curr.next = l2;
                curr = l2;
                l2=l2.next;
            }
        }
        return sentinel.next;
    }
}