链栈判断回文

1、.；#include #include typedef struct SNode int data; struct SNode *next; SNode,*LinkStack; int Push(LinkStack &top,char e) SNode *q; q=(LinkStack)malloc(sizeof(SNode); if(!q) printf(nOverflow!); return 0; q-data=e; q-next=top-next; top-next=q; return 1; char Pop(LinkStack &top,char &e) SNode *q; if(!t

2、op-next) return 0; q=top-next; top-next=q-next; e=q-data; free(q); return e; char GetTop(LinkStack top,char &e) e=top-next-data; return e; int Check(char * ch) int i,m,flg=0; char *c; char temp; SNode *top; top=(LinkStack)malloc(sizeof(SNode); top-next=NULL; for(m=1;chm!=0;m+); for(i=0;im/2;i+) Push

3、(top,chi); if(m%2) i+; while(im) if(chi=GetTop(top,temp) Pop(top,temp); else return 0; i+; return 1; int main() char c40; printf(输入字符串： ); scanf(%s,c); if(Check(c) printf(n字符串对称); else printf(n字符串不对称); system(pause);return 0; #include #include typedef struct SNode int data; struct SNode *next; SNode

4、,*LinkStack; int Push(LinkStack &top,char e) SNode *q; q=(LinkStack)malloc(sizeof(SNode); if(!q) printf(nOverflow!); return 0; q-data=e; q-next=top-next; top-next=q; return 1; char Pop(LinkStack &top,char &e) SNode *q; if(!top-next) return 0; q=top-next; top-next=q-next; e=q-data; free(q); return e;

5、 char GetTop(LinkStack top,char &e) e=top-next-data; return e; int Check(char * ch) int i,m,flg=0; char *c; char temp; SNode *top; top=(LinkStack)malloc(sizeof(SNode); top-next=NULL; for(m=1;chm!=0;m+); for(i=0;im/2;i+) Push(top,chi); if(m%2) i+; while(im) if(chi=GetTop(top,temp) Pop(top,temp); else return 0; i+; return 1; int main() char c40; printf(输入字符串： ); scanf(%