Maze/Stack.cpp at master · yachiyang01/Maze · 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
#include <iostream>
using namespace std;

enum Boolean{FALSE,TRUE};
template <class T>
class Stack{
    public:
        Stack();
        ~Stack();
        bool IsFull();
        bool IsEmpty();
        T *Delete(T&);
        void Add(const T&);
    protected:
        int MaxSize;
        int top;
        T *stacks;
};


template<class T>
Stack<T>::Stack(){

    stacks = new T[100000];
    top = -1;
}

template<class T>
Stack<T>::~Stack(){

    delete[] stacks;
    top = -1;
}
template<class T>
bool Stack<T>::IsFull(){
    if(top == 100000 - 1){
        return TRUE;
    } else return FALSE;
}

template<class T>
bool Stack<T>::IsEmpty(){
    if(top == - 1){
        return TRUE;
    } else return FALSE;
}


template<class T>
void Stack<T>::Add(const T& x){
    if(IsFull()) cout << "full!" << endl;
    else{
        stacks[++top] = x;
    }
}

template<class T>
T* Stack<T>::Delete( T& x){
    if(IsEmpty()) cout << "empty!" << endl;
    else{
        x = stacks[top--];
        return (&x);
    }
}