LeetCode 142. 数据结构->合并两个有序链表
原题链接
简单
作者:
JustDoIt11
,
2023-10-31 12:57:40
,
所有人可见
,
阅读 62
/**
* 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) {
if (list1 == null) return list2;
if (list2 == null) return list1;
ListNode ans, list3;
if (list1.val < list2.val) {
list3 = list1;
list1 = list1.next;
} else {
list3 = list2;
list2 = list2.next;
}
ans = list3;
while (list1 != null && list2 != null) {
if (list1.val < list2.val) {
list3.next = list1;
list3 = list3.next;
list1 = list1.next;
} else {
list3.next = list2;
list3 = list3.next;
list2 = list2.next;
}
}
if (list1 != null) list3.next = list1;
if (list2 != null) list3.next = list2;
return ans;
}
}