数据结构：栈-回文判断_回文判断栈

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
	char ch[101], sh[101];
	int i, len, mid, next, top;
	top = 0;
	
	//读入字符串
	gets(ch);
	len = strlen(ch);
	mid = len/2 - 1;

	//存入前一半
	for(i = 0; i <= mid; i++)
	{
		sh[++top] = ch[i];
	}
	
	//判断奇偶
	if(len%2 == 0)
	{
		next = mid + 1;
	}
	else
	{
		next = mid + 2;
	}
	
	//判断回文
	for(i = next; i < len; i++)
	{
		if(ch[i] !=sh[top])
		{
			break;
		}
		top--;
	}
	if(top == 0)
	{
		printf("是回文\n");
	}
	else
	{
		printf("不是回文\n");
	}
	
	system("pause");
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51