401 Palindrome

这道题最初我是没理解清楚题意,我以为那些reverse栏空白的字母是省略了.后来在这个论坛找到了更多的测试数据,发现了自己理解错了,重新读题= =,修改了下代码- -.弄了很久才AC

我的思路和别人有点不同的是,我是通过计算来得到在常量表中的位置

好吧= = 这道题本来该总结很多的,今天来忘记很多了.

#include<stdio.h>#include<string.h>#include<ctype.h>const int maxn = 1000;int main(){#ifdef  LOCAL    freopen("input.txt", "r", stdin);#endifint state_m = 1, state_p = 1;int len;int a, x; //a字符在数组中位置,x数组中间位置    char s[maxn];const char c[] = "A   3  HIL JM O   2TUVWXY51SE Z  89";while(scanf("%s", s) != EOF)    {            printf("%s", s);            state_m = 1; state_p = 1;            len = strlen(s);            x = (len + 1) / 2;for(int i = 0; i < x; i++)            {                a = (int)(isdigit(s[i]) ? s[i] - 23: s[i] - 65);if(s[len-1-i] == c[a]) //判断是否为mirrored                {if(s[len-1-i] != s[i]) state_p = 0;                }else                {                    state_m = 0;if(s[len-1-i] != s[i]) state_p = 0;                }            }if(state_m && state_p) printf(" -- is a mirrored palindrome.\n\n");else if(state_m) printf(" -- is a mirrored string.\n\n");else if(state_p) printf(" -- is a regular palindrome.\n\n");else printf(" -- is not a palindrome.\n\n");            memset(s, 0, sizeof(s));

    }return 0;}

转载于:https://www.cnblogs.com/shixuehunk/archive/2011/07/13/2105714.html

401 Palindrome相关推荐

UVAoJ --401
UVAoJ –401 这是第一次写的代码,编写两个函数分别判断镜像和回文,然后就是两个结果的排列组合了,根据结果不同输出不同的判断,但是以下这段代码的结果却是WA.还在理解中 #include < ...
【LeetCode】Palindrome Partitioning 解题报告
[题目] Given a string s, partition s such that every substring of the partition is a palindrome. Retur ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
234. Palindrome Linked List - Easy
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...
LeetCode 125 Valid Palindrome（有效回文）（*）
版权声明:转载请联系本人,感谢配合!本站地址:http://blog.csdn.net/nomasp https://blog.csdn.net/NoMasp/article/details/5062 ...
Lintcode108 Palindrome Partitioning || solution 题解
[题目描述] Given a strings, cutsinto some substrings such that every substring is a palindrome. Return t ...
数位DP 回文序列 POJ-3280 Cheapest Palindrome
Cheapest Palindrome [ POJ - 3280 ] 题目大意: 给定字符串s,长度为m,由n个小写字母组成.在s的任意位置增删字母,把它变成回文串,增删特定字母的花费不同,求最小花费 ...
Determine whether an integer is a palindrome. Do this without extra space.
看到这个题目的时候,首先不认识 Determine这个单词.英文不好没办法,查了下是确认的意思,然后不懂 palindrome这个单词, 查了下是回文的意思. 问题是回文是个什么东西,官方解释: A ...
[leetcode] Palindrome Number
2019独角兽企业重金招聘Python工程师标准>>> Determine whether an integer is a palindrome. Do this without e ...

401 Palindrome

401 Palindrome相关推荐

最新文章

热门文章