回文判断

//群：970353786
#include"stdio.h"
#include"stdlib.h"
typedef char ElemType;
typedef struct stnode
{
	ElemType data;
	struct stnode* next;
}StNode, * LinkStack;
int huiwen(char str[])
{
	int i = 0;
	char ch;
	StNode* sl = NULL, * p;
	while ((ch = str[i++]) != '\0')
	{
		p = (StNode*)malloc(sizeof(StNode));//给内存
		p->data = ch;
		p->next = sl;
		sl = p;
	}
	i = 0;
	while (sl != NULL)
	{
		p = sl;
		ch = p->data;
		sl = sl->next;
		free(p);//释放内存
		if (ch != str[i++])
			return 0;
	}
	return 1;
}
void main()
{
	char string[30];//最长为30
	int hw;
	printf("请输入字符串:");
	gets_s(string);
	hw = huiwen(string);
	if (hw) printf("字符串是回文.");
	else printf("字符串不是回文");
}


  

 

  
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
 

文章来源: chuanchuan.blog.csdn.net，作者：川川菜鸟，版权归原作者所有，如需转载，请联系作者。

原文链接：chuanchuan.blog.csdn.net/article/details/116906255