两个有序链表合并为一个新的有序链表
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode ans = new ListNode(Integer.MAX_VALUE);
ListNode p = ans;
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
p.next = l1;
l1 = l1.next;
} else {
p.next = l2;
l2 = l2.next;
}
p = p.next;
}
if (l1 != null) {
p.next = l1;
} else if (l2 != null) {
p.next = l2;
}
return ans.next;
}
}
原文地址:https://www.cnblogs.com/acbingo/p/9251525.html
时间: 2024-10-12 09:19:50