sda/main2.cpp at master · sherifkunch/sda · 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
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

#include <iostream>

using namespace std;
template <typename T>
struct node
{
    T data;
    node<T>* next;
};

template <typename T>
class LStack
{
private:
        node<T>* topNode;
        void copy(node<T>* toCopy);
        void eraseStack();
        void copyStack(LStack const&);
    public:
        LStack();
        LStack(LStack const&); //
        LStack& operator=(LStack const&); //
        ~LStack(); //
        bool empty() const;
        void push(T const& x);
        T pop();
        T top() const;
        T MaxElement();
};

template <typename T>
LStack<T>::LStack() : topNode(NULL) {}

template <typename T>
bool LStack<T>::empty() const {
    return topNode == NULL;
}
template <typename T>
    void LStack<T>::push(T const& x) {
    node<T>* p = new node<T>;
    p->data = x;
    p->next = topNode;
    topNode = p;
}
template <typename T>
    T LStack<T>::pop()
    {
        if(empty())
        {
            cerr<<"prazen stek!\n";
            return 0;
        }

            node<T>* p = topNode;
            topNode=topNode->next;
            T x = p->data;
            delete p;
            return x;

    }

template <typename T>
T LStack<T>::top() const
{
   if(empty())
   {
       cerr<<"prazen stek!";
   }

    return topNode->data;
}
template <typename T>
void LStack<T>::eraseStack()
{
    while(!empty())
        pop();
}
template <typename T>
LStack<T>::~LStack() {
 eraseStack();
}
template <typename T>
void LStack<T>::copy(node<T>* toCopy)
{
    if(toCopy==NULL)
        return;
    copy(toCopy->next);
    push(toCopy->data);
}

template <typename T>
void LStack<T>::copyStack(LStack const& ls) {
 topNode = NULL;
 copy(ls.topNode);
}
template <typename T>
LStack<T>::LStack(LStack const& ls) {
 copyStack(ls);
}
template <typename T>
LStack<T>& LStack<T>::operator=(LStack const& ls)
{
 if (this != &ls) {
 eraseStack();
 copyStack(ls);
 }
 return *this;
}
template <typename T>
T LStack<T>::MaxElement()
{
    T max = topNode->data;
    node<T>* start = topNode;
    start = start->next;
    while(start)
    {
        if (max < start->data) {
            max = start->data;
        }
        start = start->next;
    }

    return max;
}

int main()
{
    LStack<int> st;
    st.push(5);
    st.push(10);
    st.push(20);
    st.push(3);

    std::cout << st.top();

    std::cout << st.MaxElement() << std::endl;

    std::cout << st.top();

    return 0;
}