ength= strlen(str方h QueueInitiate(&my Queue); StackInitiate(&myStack); for(i=0; i length; i++) Queue Append ( &my Queue, str[D); StackPush(&myStack, str[); while(Queue NotEmpty(my Queue)==1&& StackNotEmpty(my Stack)==l)t if(Queue Delete (&my Queue, &x)==1 & Stack Pop(&my Stack, &y)==1&&x= y) printf(("‰%s不是回文Nn",str); return: 19 length = strlen(str); QueueInitiate(&myQueue); StackInitiate(&myStack); for(i = 0; i < length; i++) { QueueAppend(&myQueue, str[i]); StackPush(&myStack, str[i]); } while(QueueNotEmpty(myQueue)==1 && StackNotEmpty(myStack)==1){ if(QueueDelete(&myQueue, &x) == 1 && StackPop(&myStack, &y) == 1 && x != y) { printf("%s不是回文!\n", str); return; } }