Merge Two Sorted List

目录

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1==null&&l2==null){
return null;
}
ListNode resultList = new ListNode(0);
ListNode curNode = resultList;
while(l1!=null||l2!=null){
if(l1!=null&&l2!=null){
if(l1.val<l2.val){
curNode.next=l1;
l1 = l1.next;
}else{
curNode.next=l2;
l2 = l2.next;
}
curNode =curNode.next;
}else if(l1!=null){
curNode.next = l1;
break;
}else{
curNode.next=l2;
break;
}
}
return resultList.next;
}
}