/
MergeTwoSortedLists.java
38 lines (36 loc) · 1.04 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
package io.ziheng.list.leetcode;
import io.ziheng.list.leetcode.ListNode;
/**
* LeetCodde 21. Merge Two Sorted Lists
* https://leetcode.com/problems/merge-two-sorted-lists/
*/
public class MergeTwoSortedLists {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(-1);
ListNode currentNode = dummyHead;
ListNode pA = l1;
ListNode pB = l2;
while (pA != null && pB != null) {
if (pA.val < pB.val) {
currentNode.next = pA;
pA = pA.next;
} else {
currentNode.next = pB;
pB = pB.next;
}
currentNode = currentNode.next;
}
while (pA != null) {
currentNode.next = pA;
pA = pA.next;
currentNode = currentNode.next;
}
while (pB != null) {
currentNode.next = pB;
pB = pB.next;
currentNode = currentNode.next;
}
return dummyHead.next;
}
}
/* EOF */