LeetCode-合并两个有序链表(Merge Two Sorted Lists)

21. 合并两个有序链表

Difficulty: 简单

更多LeetCode答案欢迎大家关注Github: https://github.com/lxyer/LeetCodeAnswer

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

示例：

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

Solution

Language: Java

/**
 * 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 l3 = new ListNode(0);
        ListNode lastNode = l3;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                lastNode.next = l1;
                l1 = l1.next;
            } else {
                lastNode.next = l2;
                l2 = l2.next;
            }
            lastNode = lastNode.next;
        }
​
        if (l1 != null) {
            lastNode.next = l1;
        } else {
            lastNode.next = l2;
        }
​
        return l3.next; 
    }
}