forked from zapellass123/OpenEmailGenerator
-
Notifications
You must be signed in to change notification settings - Fork 1
/
LinkedListAppendKnodes.cpp
109 lines (97 loc) · 1.97 KB
/
LinkedListAppendKnodes.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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
#include <bits/stdc++.h>
using namespace std;
class node
{
public:
int data;
node *next;
node(int val)
{
data = val;
next = NULL;
}
};
int lengthFinder(node *&head)
{
// step 1 find the length of the LL
int length = 0;
node *temp = head;
while (temp != NULL)
{
length++;
temp = temp->next;
} // gotten the length of the LL;
return length;
}
node *kappend(node *&head, int k)
{
int length = lengthFinder(head);
// edge case when k is bigger than length so we do
k = k % length;
node *newHead;
node *newTail;
node *tail = head; // traversal pointer
int count = 1; // determine the pos
while (tail->next != NULL)
{
if (count == length - k)
{
newTail = tail;
}
if (count == length - k + 1)
{
newHead = tail;
}
tail = tail->next;
count++;
}
newTail->next = NULL;
tail->next = head;
return newHead;
}
void insertAtTail(node *&head, int val)
{
node *newNode = new node(val); // created a new node;
if (head == NULL)
{
head = newNode;
return;
// here you can simply call insertAtBeginning
}
node *temp = head;
while (temp->next != NULL)
{
temp = temp->next;
}
temp->next = newNode;
// as our new node already points to NULL in its next so we simply do nothing
}
void display(node *head)
{
if (head == NULL)
{
cout << "NULL" << endl;
return;
}
node *temp = head;
while (temp != NULL)
{
cout << temp->data << "->";
temp = temp->next;
}
cout << "NULL" << endl;
}
int main()
{
node *head = NULL;
insertAtTail(head, 1);
insertAtTail(head, 2);
insertAtTail(head, 3);
insertAtTail(head, 4);
insertAtTail(head, 5);
insertAtTail(head, 6);
display(head);
node *newHead = kappend(head, 3);
display(newHead);
return 0;
}