-
Notifications
You must be signed in to change notification settings - Fork 0
/
09_Stack_String_Operation.cpp
92 lines (87 loc) · 1.02 KB
/
09_Stack_String_Operation.cpp
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
#include<iostream>
#include <string.h>
#define max 10
using namespace std;
class Stack
{
public:
int top;
char stk[10];
Stack()
{
top=-1;
}
int empty()
{
if(top==-1)
return(1);
else
return(0);
}
int full()
{
if(top==max-1)
return(1);
else
return(0);
}
void push(char ch)
{
if(full())
cout<<"\nStack Is Full"<<endl;
else
{
top=top+1;
stk[top]=ch;
}
}
char pop()
{
char ch;
if(empty())
{
cout<<"Stack Is Empty"<<"\0"<<endl;
return -1;
}
else
ch=stk[top--];
return ch;
}
};
int main()
{
Stack s;
int k=0,flag;
char str[10],rev[10],ch;
cout<<"Enter String:"<<endl;
cin>>str;
for(int i=0;str[i]!='\0';i++)
{
ch=str[i];
s.push(ch);
}
while(s.top!=-1)
{
ch=s.pop();
rev[k++]=ch;
}
rev[k]='\0';
cout<<"Reversed String Is:"<<rev<<endl;
for(int i=0;str[i]!='\0';i++)
{
if(str[i]==rev[i])
{
flag=1;
}
else
{
flag=0;
}
}
if (flag==1)
{
cout<<"String Is Palindrome"<<endl;
}
else
cout<<"String Is Not Palindrome"<<endl;
}