Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #include<string.h>
- #include<stack>
- using namespace std;
- void Palindrome(string l){
- stack<char>s;
- int flag=0;
- if(l.length()%2==0){
- int mid=l.length()/2;
- for(int i=0;i<mid-1;i++){
- s.push(l[i]);
- }
- for(int i=mid;i<l.length()-1;i++){
- if(s.top()!=l[i]){
- flag=1;
- break;
- }
- s.pop();
- }
- }else{
- int mid=l.length()/2;
- for(int i=0;i<mid;i++){
- s.push(l[i]);
- }
- for(int i=mid;i<l.length()-1;i++){
- if(s.top()!=l[i]){
- flag=1;
- break;
- }
- s.pop();
- }
- }
- if(flag==0){
- cout<<"此字符串是回文串"<<endl;
- }else{
- cout<<"此字符串不是回文串"<<endl;
- }
- }
- int main(){
- string t;
- cin>>t;
- Palindrome(t);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement