本程序实现判断一个字符串是否为回文字符串,具体表示如下:回文字符串指的是字符串正向读和反向读只同一种字符,例如’abba’就是一个回文字符串,而‘abcaa’则不是一个回文字符,本程序使用栈这种存储结构实现字符串反序,进而使用strcmp()函数进行比较字符串是否相等,思路较为简单。
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 15
#define Pa Palindrome
typedef struct
{
char Pa[N];
int top;
}Stack;
Stack *Init_Stack()
{
Stack *s;
s = malloc(sizeof(Stack));
s->top = -1;
return s;
}
int Empty_Stack(Stack *s)
{
if (s->top == -1) return 1;
else return 0;
}
int Push_Stack(Stack *s, char C)
{
if (s->top == N - 1) return 0;
else
{
s->top++;
s->Palindrome[s->top] = C;
return 1;
}
}
int Pop_Stack(Stack *s,char *c)
{
*c=s->Palindrome[s->top];
s->top–;
return 1;
}
int main()
{
Stack *s;
s = Init_Stack();
int n;
char ch[N];
printf(“请给数组元素赋值:\n”);
scanf("%s",ch);
n = strlen(ch);
way(s, ch, n);
}
way(Stack *s, char ch[N], int m)
{
int i;
char Ch[N];
char chr = {0};
char *q;
for (i = 0; i < m; i++)
Push_Stack(s, ch[i]);
printf(“读取出栈元素:\n”);
for(i=0;i<m;i++)
{
q = &chr;
Pop_Stack(s,q);
Ch[i] = chr;
}
Ch[m] = ‘\0’;
if (strcmp(ch, Ch) == 0)
printf(“该字符串是回文字符串!\n”);
else
printf(“该字符不是回文字符串!\n”);
return 0;
}