CppPracticum/task10_2.cpp at master · alsayedaleks/CppPracticum · 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
143
144
145
146
147
148
149
150

#include <iostream>
#include <stack>

using namespace std;

namespace MyStack{

   // 1) push(x1) ->  (NULL, x1)
   // 2) push(x2) ->  (ptr1,x2), ptr1->1)
   // 3) push(x3) ->  (ptr2,x3), ptr2->2)
  template <typename T>
  struct Node{
     T data;
     Node* ptr;
     //Node(int x){ data =x; ptr = new Node(x);}
  };

  template <typename T>
  class Stack{
     Node<T>* node;
     public:
     Stack() { node = nullptr;}

      int push(T x) {
         Node<T>* newNode = new Node<T>();
         newNode->data = x;
         newNode->ptr = node;
         node = newNode;
         return 0;
      }
      void show();
      int pop(){
         if(empty()) throw "Empty Stack";
         Node<T>* prev = node->ptr;
         delete node;
         node = prev;
         return 0;
      }
      T top(){
         return node->data;
      }
      bool empty(){
         return node==nullptr;
      }
  };

  template <typename T>
  void Stack<T>::show(){
      while(node!=nullptr){
         cout<<" "<<top();
         pop();
      }
  }

}


template <typename T>
size_t input(MyStack::Stack<T> & masiv){

   size_t k =0;

   while(true){
      T x;
      cin>>x;
      if (x==0)break;
      //masiv[k++] = x;
      masiv.push(x);
  }
  return k;
}


template <>
size_t input(MyStack::Stack<char> & masiv){

   size_t k =0;

   while(true){
      char x;
      cin>>x;
      if (x=='0')break;
      //masiv[k++] = x;
      masiv.push(x);
  }
  return k;
}


template <typename T>
size_t input2(stack<T> & masiv){

   size_t k =0;

   while(true){
      T x;
      cin>>x;
      if (x==0)break;
      //masiv[k++] = x;
      masiv.push(x);
  }
  return k;
}


template <typename T>
  void show(stack<T> & s){
      while(!s.empty()){
         cout<<" "<<s.top();
         s.pop();
      }
  }

size_t input(int* masiv){

   size_t k =0;

   while(true){
      int x;
      cin>>x;
      if (x==0)break;
      masiv[k++] = x;
  }
  return k;
}


int main(){
  using namespace MyStack;
  //vector<int> a;
  Stack<int> a;

  size_t n = input(a);

  a.show();

  Stack<char> b;

  n = input(b);

  b.show();

  stack<int> c; // std::stack
  n = input2(c);
  show(c);


}