0

因此，T 找到了一百万个检查单个单词回文的回文程序示例。

但是 T 需要帮助一个字一个字地做，例如句子你可以把一只燕子关在笼子里，但你不能吞下一个笼子吗？这是

// FILE: pal.cxx
// Program to test whether an input line is a palindrome. Spaces,
// punctuation, and the difference between upper- and lowercase are ignored.

#include <cassert>    // Provides assert
#include <cctype>     // Provides isalpha, toupper
#include <cstdlib>    // Provides EXIT_SUCCESS
#include <iostream>   // Provides cout, cin, peek
#include <queue>      // Provides the queue template class
#include <stack>      // Provides the stack template class
using namespace std;

int main( )
{
queue<char> q;
stack<char> s;
char letter;            
queue<char>::size_type mismatches = 0;  // Mismatches between queue and stack
cout << "Enter a line and I will see if it's a palindrome:" << endl;

while (cin.peek( ) != '\n')
{
    cin >> letter;
    if (isalpha(letter))
    {
        q.push(toupper(letter));
        s.push(toupper(letter));
    }
}

while ((!q.empty( )) && (!s.empty( )))
{
    if (q.front( ) != s.top( ))
        ++mismatches;
    q.pop( );
    s.pop( );
}

if (mismatches == 0)
    cout << "That is a palindrome." << endl;
else
    cout << "That is not a palindrome." << endl;    
return EXIT_SUCCESS;

}

4

1 回答 1

1

实际上，这很容易从您的基本代码中完成。您只需要将单词（字符串）添加到队列和堆栈中，而不是字符。我很快修改了代码：

#include <algorithm>
queue<std::string> q;
stack<std::string> s;
std::string word;
queue<std::string>::size_type mismatches = 0;  // Mismatches between queue and stack
cout << "Enter a line and I will see if it's a palindrome:" << endl;

while (cin.peek( ) != '\n')
{
    cin >> word;
    std::transform(word.begin(), word.end(), word.begin(), ::toupper);
    q.push(word);
    s.push(word);
}

通过使用 cin 读取字符串，您会自动使用空格作为分隔符。该行：

std::transform(word.begin(), word.end(),word.begin(), ::toupper);

将字符串中的所有字符转换为大写。

于 2013-03-25T05:01:53.577 回答