【LeetCode】#21合并两个有序链表(Merge Two Sorted Lists)

【LeetCode】#21合并两个有序链表(Merge Two Sorted Lists)、

题目描述

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

示例

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

Description

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.

Example

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

解法

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