forked from arashVsh/AP_Git_Practice
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3.cpp
158 lines (150 loc) · 2.17 KB
/
3.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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#include<stdio.h>
#include<stdlib.h>
#pragma warning(disable:4996)
#define MAX_SIZE 200
int arr[MAX_SIZE];
typedef struct alfa* alfaptr;
struct alfa {
long long x;
alfaptr next;
};
alfaptr rear = NULL, front = NULL;
void push(int x)
{
alfaptr node;
node = (alfaptr)malloc(sizeof(struct alfa));
node->x = x;
if (front == NULL)
front = node;
node->next = NULL;
if (rear != NULL)
rear->next = node;
rear = node;
}
void pop()
{
alfaptr node;
if (!front)
printf("ERROR1");
else
{
node = front;
front = front->next;
free(node);
}
}
void search(int x)
{
alfaptr node = front;
int counter = 0;
while (node) {
if (node->x == x) {
counter++;
printf("%d\t", counter);
}
else if(node ==NULL && counter==0) {
printf("ERROR2");
break;
}
node = node->next;
}
}
void rpop() {
alfaptr node = front;
while (node->next != rear)
node = node->next;
free(rear);
rear = node;
rear->next = NULL;
}
int size()
{
alfaptr node = front;
int count = 0;
while (node) {
count++;
node = node->next;
}
return count;
}
void set()
{
alfaptr node = front;
for (int i = 0; i < size() && node; i++, node = node->next)
arr[i] = node->x;
}
void show()
{
if (front) {
for (int i = 0; i < size(); i++)
printf("%d ", arr[i]);
}
else
{
printf("ERROR3");
}
}
// here is a better implementaion of the show function
//void show()
//{
// if (front) {
// alfaptr node = front;
// while (node) {
// printf("%lld ", node->x);
// node = node->next;
// }
// }
// else {
// for (int i = 0; i < MAX_SIZE; i++)
// printf("%d ", arr[i]);
// }
//}
int average()
{
alfaptr node = front;
int sum = 0;
int count = 0;
while (node) {
sum += node->x;
count++;
node = node->next;
}
return sum / count;
}
int main()
{
int cmd;
long long int x;
while (true)
{
scanf("%d", &cmd);
switch (cmd)
{
case 1://push
scanf("%lld", &x);
push(x);
break;
case 2://pop
pop();
break;
case 3://rpop
rpop();
break;
case 4://search
scanf("%lld", &x);
search(x);
break;
case 5://set
set();
break;
case 6://show
show();
break;
case 7://size
printf("%d", size());
break;
case 10:
exit(0);
}
}
}