-
Notifications
You must be signed in to change notification settings - Fork 73
Expand file tree
/
Copy pathMergeTwoSortedLists.java
More file actions
40 lines (34 loc) · 925 Bytes
/
MergeTwoSortedLists.java
File metadata and controls
40 lines (34 loc) · 925 Bytes
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
package algorithm.lc;
/**
* 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.
*/
public class MergeTwoSortedLists {
public class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
// Start typing your Java solution below
// DO NOT write main() function
ListNode head = new ListNode(0);
ListNode cur = head;
while (l1 != null || l2 != null) {
if (l1 == null || l2 != null && l1.val > l2.val) {
cur.next = l2;
l2 = l2.next;
} else if (l2 == null || l1 != null && l1.val <= l2.val) {
cur.next = l1;
l1 = l1.next;
}
cur = cur.next;
}
return head.next;
}
}
}