DSA/multiplestack.cpp at master · tanyarai5446/DSA · GitHub

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
#include<iostream>
using namespace std;
#define max 6
struct Mstack
{
    int data[max];
    int topA,topB;
};
Mstack s,*p;
void init()
{
    p=&s;
    p->topA=-1;
    p->topB=max;
}
int emptyA()
{
    if(p->topA==-1)
    return 1;
    else
    return 0;
}
int emptyB()
{
    if(p->topB==max)
    return 1;
    else
    return 0;
}
int full()
{
    if(p->topA+1==p->topB)
    return 1;
    else
    return 0;
}
void pushA(int x)
{
    if(full())return;
    p->topA++;
    p->data[p->topA]=x;
}
void pushB(int x)
{
    if(full())return;
    p->topB--;
    p->data[p->topB]=x;
}
int popA()
{
    if(emptyA())return 0;
    int y=p->data[p->topA];
    p->topA--;
    return y;
}
int popB()
{
    if(emptyB())return 0;
    int y=p->data[p->topB];
    p->topB++;
    return y;
}
int main()
{
    init();
    for(int i=0;i<3;i++)
    pushA(i);
    for(int i=3;i<6;i++)
    pushB(i);
    cout<<popA()<<endl;
    cout<<popA()<<endl;
    cout<<popB()<<endl;
}