题目:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
代码:
public class Test13 {
public class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1==null) {
return l2;
}else 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 temp = result;
while (l1!=null && l2!=null){
if (l1.val<=l2.val) {
result.next = new ListNode(l1.val);
result = result.next;
l1=l1.next;
}else {
result.next = new ListNode(l2.val);
result = result.next;
l2=l2.next;
}
}
if (l1==null) {
result.next = l2;
}else{
result.next = l1;
}
return temp;
}
}