-
Notifications
You must be signed in to change notification settings - Fork 56
/
Solution.java
44 lines (41 loc) · 1.43 KB
/
Solution.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
package g0001_0100.s0021_merge_two_sorted_lists;
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
// #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
// #2023_08_09_Time_0_ms_(100.00%)_Space_40.9_MB_(99.19%)
import com_github_leetcode.ListNode;
/*
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode list = new ListNode(-1);
ListNode head = list;
while (l1 != null || l2 != null) {
if (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
list.next = new ListNode(l1.val);
l1 = l1.next;
} else {
list.next = new ListNode(l2.val);
l2 = l2.next;
}
} else if (l1 != null) {
list.next = new ListNode(l1.val);
l1 = l1.next;
} else {
list.next = new ListNode(l2.val);
l2 = l2.next;
}
list = list.next;
}
return head.next;
}
}