-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathoddstack.cpp
More file actions
104 lines (82 loc) · 1.13 KB
/
Copy pathoddstack.cpp
File metadata and controls
104 lines (82 loc) · 1.13 KB
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
#include <iostream>
using namespace std;
class STACK
{
private:
struct node
{
int item;
node* next;
node(int x, node* t)
{
item = x; next = t;
}
};
typedef node *link;
link head;
public:
STACK()
{
head = 0;
}
void print()
{
link it = head;
if(it== NULL)
cout<<" "<<endl;
else
{
cout<<"STACK :: ";
while(it!=NULL)
{
cout<<it->item<<" ";
it = it->next;
}
cout<<endl;
}
}
int empty() const
{
return head == 0;
}
void push(int x)
{
head = new node(x, head);
}
int pop()
{
int v = head->item;
link t = head->next;
delete head;
head = t;
return v;
}
int Odds(STACK s)
{
int count=0;
while(!s.empty())
{
int e = s.pop();
if(e%2 != 0)
count++;
}
return count;
}
}; // end of class STACK
int main()
{
STACK s;
int element;
cout<<"Enter elements::"<<endl;
while(element!=-1)
{
cin>>element;
if(element!=-1)
{
s.push(element);
s.print();
}
}
int count = s.Odds(s);
cout<<"Odd Count is "<<count<<endl;
}