Data-Structures-and-Algorithms/CPP/Leetcode/1669-merge-in-between-linked-lists/1669-merge-in-between-linked-lists.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/Leetcode/1669-merge-in-between-linked-lists/1669-merge-in-between-linked-lists.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.8 (2827 reviews)
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) {}
 * };
*/
classSolution {
public:
 ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2) {
intindex = 0;
 ListNode * keep = list1;
 ListNode * deleted;
 ListNode * cat;
while (index != a - 1) {
 keep = keep -> next;
index ++;
 }
 deleted = keep;

while (index != b + 1) {
 keep = keep -> next;
index ++;
 }
 cat = keep;
 deleted -> next = list2;
while (list2 -> next != nullptr) {
 list2 = list2 -> next;
 }
 list2 -> next = cat;
return list1;

 }
};