B - use reverse

最新推荐文章于 2024-02-21 11:01:09 发布

我爱卷粉

最新推荐文章于 2024-02-21 11:01:09 发布

阅读量194

点赞数 1

分类专栏： # reverse函数文章标签：回文字符串

本文链接：https://blog.csdn.net/qq_42319677/article/details/81196433

版权

reverse函数专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Time limit 1000 ms Memory limit 32768 kB OS Windows

Write a program to determine whether a word is a palindrome. A palindrome is a sequence of characters that is identical to the string when the characters are placed in reverse order. For example, the following strings are palindromes: “ABCCBA”, “A”, and “AMA”. The following strings are not palindromes: “HELLO”, “ABAB” and “PPA”.

Input

The input file will consist of up to 100 lines, where each line contains at least 1 and at most 52 characters. Your program should stop processing the input when the input string equals “STOP”. You may assume that input file consists of exclusively uppercase letters; no lowercase letters, punctuation marks, digits, or whitespace will be included within each word.

Output

A single line of output should be generated for each string. The line should include “#”, followed by the problem number, followed by a colon and a space, followed by the string “YES” or “NO”.

Sample Input

ABCCBA
A
HELLO
ABAB
AMA
ABAB
PPA
STOP

Sample Output

#1: YES
#2: YES
#3: NO
#4: NO
#5: YES
#6: NO
#7: NO

代码：

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
    string str1,str2;
    int cas=0;
    while(cin>>str1){
            if(str1=="STOP")break;
            else{
                str2=str1;
                reverse(str2.begin(),str2.end());
                if(str1==str2)
                   cout<<'#'<<++cas<<':'<<' '<<"YES"<<endl;
                else
                   cout<<'#'<<++cas<<':'<<' '<<"NO"<<endl;

            }

    }
    return 0;

}