原题链接:力扣
描述:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = []
输出:[]
示例 3:
输入:l1 = [], l2 = [0]
输出:[0]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路:
略
代码:
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
if (list1 == null) {
return list2;
}
if (list2 == null) {
return list1;
}
ListNode head = null;
ListNode current = null;
while (list1 != null && list2 != null) {
ListNode node;
if (list1.val < list2.val) {
node = list1;
list1 = list1.next;
} else {
node = list2;
list2 = list2.next;
}
if (head == null) {
head = node;
current = head;
} else {
current.next = node;
current = current.next;
}
}
if (list1 != null ) {
current.next = list1;
}
if (list2 != null ) {
current.next = list2;
}
return head;
}
}