int Symmetry_SeqStack(SeqStack *S)
{
int j;
if (S->top%2==0)
{printf("not have symmetry!\n");return(-1);}
else
for(j=0;j<S->top/2;j++)
{
if(S->data[j]!=S->data[S->top-j])
{printf("not have symmetry!\n");return(-1);}
}
printf("have symmetry!\n");
return(1);
}
void Print_SeqStack(SeqStack *S)
{
int i=0;
for (i=S->top;i>=0;i--)
{printf("%d %c\n",i,S->data[i]);}
printf("\nS->top=%d\n",S->top);