Description: Assumptions are read and read the same sequence of characters as "palindrome", for example, Abba and abcba is a palindrome, ABCDE and ababab is not a palindrome. Try to write an algorithm for distinguishing reads a sequence of characters at the end of the @ is for "palindrome"
To Search:
File list (Check if you may need any files):
利用栈和队列判断字符串是否是回文.doc