-
Notifications
You must be signed in to change notification settings - Fork 2
/
MergeTwoSortedLists.java
76 lines (63 loc) · 1.67 KB
/
MergeTwoSortedLists.java
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
package Leetcode;
import java.util.List;
/**
* @author kalpak
*
* Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.
*
* Example 1:
* Input: l1 = [1,2,4], l2 = [1,3,4]
* Output: [1,1,2,3,4,4]
*
* Example 2:
* Input: l1 = [], l2 = []
* Output: []
*
* Example 3:
* Input: l1 = [], l2 = [0]
* Output: [0]
*
* Constraints:
*
* The number of nodes in both lists is in the range [0, 50].
* -100 <= Node.val <= 100
* Both l1 and l2 are sorted in non-decreasing order.
*
*/
public class MergeTwoSortedLists {
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode head = new ListNode(-1);
ListNode current = head;
while(l1 != null && l2 != null) {
if(l1.val < l2.val) {
current.next = l1;
l1 = l1.next;
} else {
current.next = l2;
l2 = l2.next;
}
current = current.next;
}
if(l1 != null) {
current.next = l1;
}
if(l2 != null) {
current.next = l2;
}
return head.next;
}
public static void main(String[] args) {
ListNode l1 = new ListNode(1);
l1.next = new ListNode(2);
l1.next.next = new ListNode(4);
ListNode l2 = new ListNode(1);
l2.next = new ListNode(3);
l2.next.next = new ListNode(4);
ListNode result = mergeTwoLists(l1, l2);
while(result != null) {
System.out.print(result.val + "->");
result = result.next;
}
System.out.println("END");
}
}