-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsaiful.stack.cpp
More file actions
80 lines (67 loc) · 1.34 KB
/
Copy pathsaiful.stack.cpp
File metadata and controls
80 lines (67 loc) · 1.34 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
#include<iostream>
#include"stack.h"
using namespace std;
void staack :: push(int a)
{
if(sizee==0)
{
t=a;
sizee=1;
// for(int i=0;i<sizee;i++)
// cout << A[0] << endl;
}
else if(sizee==1)
{
/*int *temp = new int [sizee];
temp[sizee-1]=t;
A=new int[sizee+1];
for(int i=0;i<sizee-1;i++)
A[i]=temp[i];
delete [] temp;
A[sizee-1]=a; */
sizee=3;
A=new int[sizee];
A[0]=t;
A[1]=a;
//for(int i=0;i<sizee;i++)
// cout << A[i] << endl;
}
else
{
int *temp = new int [sizee-1];
for(int i=0;i<sizee;i++)
temp[i]=A[i];
delete [] A;
//sizee=sizee+1;
A=new int[sizee];
for(int i=0;i<sizee-1;i++)
A[i]=temp[i];
delete [] temp;
A[sizee-1]=a;
sizee=sizee+1;
t=sizee;
/* for(int i=0;i<sizee;i++)
cout << A[i] << endl; */
}
/*for(int i=0;i<sizee;i++)
cout << A[i] << endl; */
}
void staack :: print()
{
for(int i=0;i<sizee-1;i++)
cout << A[i] << endl;
}
int staack :: pop()
{
if(sizee==t)
{
sizee=sizee-2;
return A[sizee];
}
else if(sizee>=0)
{
return A[--sizee];
}
else
cout << "Stack empty\n";
}