Stack(SN)

 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
// stack.cpp: определяет точку входа для консольного приложения.
//
#include "stdafx.h"
#include <iostream>
#include <conio.h>
using namespace std;
struct chain
{
int num;
chain *next;
};
chain * push(chain*, int);
chain * pop(chain*);
void printstack(chain*);
chain * Process(chain*);
float AverageINT(int, int);
void Process(chain*, float);
int _tmain(int argc, _TCHAR* argv[])
{
int quentity, number, sum = 0;
float average;
chain* top = NULL;
cout << "Enter the number of stacks: ";
cin >> quentity;
for (int i = 0; i < quentity; i++)
{
cout << "[" << i + 1 << "]: ";
cin >> number;
sum += number;
top = push(top, number);
}
average = sum/quentity;
cout << "The stack before processing: ";
printstack(top);
cout << "Average: " << average << endl;
Process(top, average);
_getch();
return 0;
}
void Process(chain * top, float average)
{
while(top)
{
if(((float) top->num) < average)
cout << top->num << " ";
top = top->next;
}
}
chain * push(chain* top, int what)
{
chain * pv = new chain;
pv->num = what;
pv->next = top;
return pv;
}
chain * pop(chain * top)
{
chain * pv = top->next;
delete top;
return pv;
}
void printstack(chain* top)
{
while (top)
{
cout << top->num << " ";
top = top->next;
}
cout << endl;
}
chain* Process(chain* stack)
{
while (stack->next!=NULL)
{
if (stack->next->num < 0)
{
stack->next = stack->next->next;
stack = stack->next;
// stack = pop(stack);
}
}
return stack;
}