UVA 401 回文词 刘汝佳紫书

A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string “ABCDEDCBA” is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left. A mirrored string is a string for which when each of the elements of the string is changed to its reverse(ifithasareverse)andthestringisreadbackwardstheresultisthesameastheoriginalstring. For example, the string “3AIAE” is a mirrored string because ‘A’ and ‘I’ are their own reverses, and ‘3’ and ‘E’ are each others’ reverses. A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria of a mirrored string. The string “ATOYOTA” is a mirrored palindrome because if the string is read backwards, the string is the same as the original and because if each of the characters is replaced by its reverse and the result is read backwards, the result is the same as the original string. Of course, ‘A’, ‘T’, ‘O’, and ‘Y’ are all their own reverses. A list of all valid characters and their reverses is as follows.

分析:这里紫书上的方法很精简,对刘汝佳更加的佩服;对于镜像的处理是先进行预处理,预先储存好存在镜像单词的镜像,然后直接查询;

代码:

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctype.h>

using namespace std;
const char*  rev = "A   3  HIL JM O   2TUVWXY51SE Z 8 ";
const char * msg[] = { "is not a palindrome.","is a regular palindrome.","is a mirrored string.","is a mirrored palindrome." };

char r(char ch)
{
	if (isalpha(ch))		return rev[ch - 'A'];
	return		rev[ch - '0' + 25];
}

int main()
{
	char s[30];
	while (scanf("%s", s) !=EOF)
	{
		int len = strlen(s);
		int p = 1, m = 1;
		for (int i = 0; i < (len + 1) / 2; i++)
		{
			if (s[i] != s[len - 1 - i])  p = 0;
			if ( r( s[i] ) != s[len - 1 - i])	m = 0;
		//	if (p == 0 && m == 0) break;
		}
		printf("%s -- %s\n\n", s, msg[m * 2 + p]);
	}
	//system("pause");
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值