赵二的刷题日记017《合并两个有序链表》

Merge Two Sorted Lists

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

Example 1:

Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

Input: l1 = [], l2 = []
Output: []

Example 3:

Input: l1 = [], l2 = [0]
Output: [0]

/**
 * 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 h1 = l1;
        ListNode h2 = l2;
        ListNode hh = new ListNode(0);
        ListNode res = hh;
        
        if (h1 == null) return h2;
        if (h2 == null) return h1;
        
        System.out.println(h1.val);
        
        while (h1 != null || h2 != null) {
            if (h1 == null && h2 != null) {
                hh.next = h2;
                h2 = h2.next;
                hh = hh.next;
                continue;
            }
            
            if (h1 != null && h2 == null) {
                hh.next = h1;
                h1 = h1.next;
                hh = hh.next;
                continue;
            }
            if (h1.val < h2.val) {
                hh.next = h1;
                h1 = h1.next;
            } else {
                hh.next = h2;
                h2 = h2.next;
            }
            hh = hh.next;
        }
        
        return res.next;
    }
}