-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
38 lines (31 loc) · 977 Bytes
/
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
/**
* 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; }
* }
*/
class Solution {
public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
ListNode temp = new ListNode(0);
temp.next = list1;
ListNode current = temp;
for (int i = 0; i < a; i++) {
current = current.next;
}
ListNode beforeA = current;
for (int i = a; i <= b; i++) {
current = current.next;
}
ListNode afterB = current.next;
beforeA.next = list2;
while (list2.next != null) {
list2 = list2.next;
}
list2.next = afterB;
return temp.next;
}
}