题目：https://leetcode-cn.com/problems/merge-two-sorted-lists/submissions/
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例：
输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4
答案一：
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1==null) return l2;
if(l2==null) return l1;
ListNode result = null;
if(l1.val<l2.val){
result = new ListNode(l1.val);
l1 = l1.next;
}else{
result = new ListNode(l2.val);
l2 = l2.next;
}
ListNode p = result;
while (l1!=null && l2!=null){
if(l1.val<l2.val){
p.next = new ListNode(l1.val);
p = p.next;
l1 = l1.next;
}else{
p.next = new ListNode(l2.val);
p = p.next;
l2 = l2.next;
}
}
if(l1 !=null){
p.next = l1;
}
if(l2!=null){
p.next = l2;
}
return result;
}
答案二：
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1==null) return l2;
if(l2==null) return l1;
ListNode result = null;
ListNode p = null;
if(l1.val<l2.val){
result = l1;
l1 = l1.next;
p = result;
while (l1!=null && l2!=null){
if(l1.val<l2.val){
p = l1;
l1 = l1.next;
}else{
ListNode temp = new ListNode(l2.val);
temp.next = l1;
p.next = temp;
l2 = l2.next;
p = p.next;
}
}
if(l2!=null){
p.next = l2;
}
}else{
result = l2;
l2 = l2.next;
p = result;
while (l1!=null && l2!=null){
if(l2.val<l1.val){
p = l2;
l2 = l2.next;
}else{
ListNode temp = new ListNode(l1.val);
temp.next = l2;
p.next = temp;
l1 = l1.next;
p = p.next;
}
}
if(l1!=null){
p.next = l1;
}
}
return result;
}
177
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
