合并两个排序的链表

题目描述

代码

/**
 * 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 newList = new ListNode(0);
        ListNode cur = newList;

        while(l1 != null && l2 != null){
            if(l1.val < l2.val){
                cur.next = l1;
                l1 = l1.next;
                cur = cur.next;
            }else{
                cur.next = l2;
                l2 = l2.next;
                cur = cur.next;
            }
        }
        //合并剩下的节点
        if(l1 != null){
            cur.next = l1;
        }else{
            cur.next = l2;
        }
        return newList.next;
    }
}