21. 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.

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) return l2;
     if(l2 == null) return l1;
     ListNode head = new ListNode(0);
     ListNode handler = head;
     //结点 handler只是一个临时的搬运工，负责合并链表的梳理工作。
     while(l1 != null && l2 != null){
         if(l1.val <= l2.val){
             handler.next = l1;
             l1 = l1.next;
         }else{
             handler.next = l2;
             l2 = l2.next;
         }
         handler = handler.next;
     }
     if(l1 != null)
         handler.next = l1;
     else if(l2 != null)
         handler.next = l2;
     
     return head.next;    
    }
}