Enter a string of characters with a number of characters not exceeding 100, with "." End. Determine if they constitute a palindrome. "Analysis" the so-called palindrome refers to from left to right and from right to left to read a string of characters is the same value, such as 12321,ABCBA,AA. First read the string of characters to be judged (put in the array letter), and remember the length of the string characters, and then compare the first and last characters, and keep moving toward the middle, you can determine whether it is a palindrome. The procedure is as follows:
#include <iostream>
using namespace Std;
int main ()
{
Char ch,letter[101];
cin>>ch;
int i=0,j=1;
while (ch!= '. ')
{
++i;
Letter[i]=ch;
cin>>ch;
}
while ((J<i) && (Letter[j]==letter[i])
{
--i;++j;
}
if (j>=i) cout<< "yes" <<endl;
else cout<< "No" <<endl;
return 0;
}
Enter a string of characters with a number of characters not exceeding 100, with "." End. Determine if they constitute a palindrome.
