-
Notifications
You must be signed in to change notification settings - Fork 6
/
1669.cpp
37 lines (29 loc) · 808 Bytes
/
1669.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2) {
ListNode* head = list1, *tail = list1, *point = list2;
a--;
while(a--){
head = head->next;
}
while(b--){
tail = tail->next;
}
head->next = list2;
while(point->next){
point = point->next;
}
point->next = tail->next;
return list1;
}
};