program4/specialstack.h at main · cb0tt/program4 · 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
#ifndef SPECIALSTACK_H
#define SPECIALSTACK_H
#include <iostream>
#include <stack>

using namespace std;


class SpecialStack
{

    // set top = vector, vector<int>top_Vector

stack<int> numbers;

public:
    SpecialStack()
    {

    }

    void printStack(){
        while (! numbers.empty()){
            cout << numbers.top() << " ";
            int topElement = numbers.top();
            numbers.pop();


        }
        cout << endl;
    }

    int pop()
    {
        if (numbers.empty()) {
            throw -1;
        }

        int top = numbers.top();
        numbers.pop();
        return top;


    }

    int popOdd(){
        if (numbers.empty()) {
            throw -1;
        }
        stack<int>odd;
        int oddNumber;
        while (! numbers.empty()){
            if (numbers.top()% 2 != 0)// % remainder of division
            {
             oddNumber = numbers.top();
             numbers.pop();

            break;
            }

            else
            {
            int topElement = numbers.top();
            numbers.pop();
            odd.push(topElement);

            }

        }
        while(! odd.empty()){
            int topElement = odd.top();
            odd.pop();
            numbers.push(topElement);


        }
        return oddNumber;
    }

    int popEven(){
        if (numbers.empty()) {
           throw -1;
        }
        stack<int>even;
        int evenNumber;
        while (! numbers.empty()){
            if (numbers.top()% 2 == 0)
            {
                evenNumber = numbers.top();
                numbers.pop();
                break;

            }

            else
            {
                int topElement = numbers.top();
            numbers.pop();
            even.push(topElement);


            }

        }
        while(! even.empty()){
           int topElement = even.top();
            even.pop();
            numbers.push(topElement);
        }
        return evenNumber;
    }

    void push(int number){
        numbers.push(number);

    }


};

#endif // SPECIALSTACK_H