-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfifteenth.cpp
82 lines (82 loc) · 1.75 KB
/
fifteenth.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
#include <iostream>
using namespace std;
struct node
{
int data;
node* next;
};
node* head;
node* getNewNode(int x)
{
node* temp = new node();
temp->data = x;
temp->next = NULL;
return temp;
}
void insert(int n,int x) {
node* temp = getNewNode(x);
node* temp1 = head;
if (n==1) {
temp->next = head;
head = temp;
}
else
{
for (int i = 0; i < n - 2; i++) {
temp1 = temp1->next;
}
temp->next = temp1->next;
temp1->next = temp;
}
}
void display(/* arguments */) {
node* temp = head;
while (temp != NULL) {
std::cout << temp->data << '\n';
temp = temp->next;
}
}
void problem(){
node* prevNode = NULL;
node* currentNode = head;
node* nextNode = head->next;
while (currentNode != NULL) {
if (currentNode->data % 2 == 0) {
nextNode = currentNode->next;
currentNode->next = head;
head = currentNode;
currentNode = nextNode;
if (prevNode == NULL) {
prevNode = head;
}
else{
prevNode->next = nextNode;
}
}
else{
currentNode = currentNode->next;
nextNode = nextNode->next;
if (prevNode == NULL) {
prevNode = head;
}
else{
prevNode = prevNode->next;
}
}
}
}
int main(int argc, char const *argv[]) {
head = NULL;
insert(1,3);
insert(2,4);
insert(3,5);
insert(4,6);
insert(5,7);
insert(6,8);
insert(7,9);
display();
problem();
std::cout << '\n';
display();
return 0;
}