将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = []
输出:[]
示例 3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
- 两个链表的节点数目范围是 [0, 50]
- -100 <= Node.val <= 100
- l1 和 l2 均按 非递减顺序 排列
/**
* 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 list1, ListNode list2) {
ListNode index1 = list1;
ListNode index2 = list2;
ListNode dummyNode = new ListNode(0);
ListNode cur = dummyNode;
while(index1 != null && index2 != null){
if(index1.val <= index2.val){
cur.next = index1;
index1 = index1.next;
cur = cur.next;
}
else{
cur.next = index2;
index2 = index2.next;
cur = cur.next;
}
}
while(index1 != null){
cur.next = index1;
index1 = index1.next;
cur = cur.next;
}
while(index2 != null){
cur.next = index2;
index2 = index2.next;
cur = cur.next;
}
return dummyNode.next;
}
}