java - 从 java 转换为 C++

Question

很难说出这里问的是什么。这个问题是含糊的、模糊的、不完整的、过于宽泛的或修辞性的，无法以目前的形式得到合理的回答。如需帮助澄清此问题以便重新打开它， visit the help center 。

已关闭 12 年前。

如何将以下内容转换为 C++

public class Palindrome
{
    public static void main(String args[])
    {
        String phrase;
        Palindrome program = new Palindrome();

        /*gets a phrase from the user and reads it*/
        BufferedReader keyboard = new BufferedReader(new InputStreamReader(System.in));

        System.out.print("Enter a phrase =>");
        System.out.flush();

        phrase = keyboard.readLine();

        /*determines if the phrase is a palindrome and prints result*/
        if(!program.isPalindrome(phrase))
            System.out.println("The phrase is NOT a palindrome.");

        else System.out.println("The phrase is a palindrome.");

    }

    public static boolean isPalindrome(String testString)
    {
        Stack s = new Stack();
        Queue q = new Queue();
        String temp = testString.toLowerCase();
        for (int i = 0; i < temp.length(); i++) {
        Character c = new Character(temp.charAt(i));
        if (!Character.isWhitespace(c.charValue())) {
            s.push(c);
            q.enqueue(c);
        }
        }
        while (!s.isEmpty()) {
        Character a = (Character)s.pop();
        Character b = (Character)q.dequeue();
        if (!a.equals(b))
            return false;
        }
        return true;
    }
}

<小时/>

public class Queue
{
        private LinkedList myList;

    public Queue()
    {
        myList = new LinkedList();
    }

    /**
     * This method should return null if the Queue is empty
     */
    public Object deQueue()
    {
        return myList.removeHead();
    }

    public void enQueue(Object addObj)
    {
        myList.addTail(addObj);
    }

    /**
     * This method should return true if the queue has no more 
     * elements in it
     */
    public boolean isEmpty()
    {
        myList.resetIndex();
        return (myList.getIndexedNode() == null);
    }
}

<小时/>

public class Stack
{
        private LinkedList myList;

    public Stack()
    {
        myList = new LinkedList();
    }

    /**
     * This method should return null if the Stack is empty
     */
    public Object pop()
    {
        return myList.removeHead();
    }

    public void push(Object addObj)
    {
        myList.addHead(addObj);
    }

    /**
     * This method should return true if the stack has no more 
     * elements in it
     */
    public boolean isEmpty()
    {
        myList.resetIndex();
        return (myList.getIndexedNode() == null);
    }

}

Answer 1

如果这是一个有效的问题，我想我会这样做:

#include <string>
#include <iostream>

bool is_palindrome(std::string const &input) { 
    return input == std::string(input.rbegin(), input.rend());
}

int main() { 
    std::cout << "Enter a phrase =>";
    std::string input;
    std::getline(std::cin, input);

    std::cout << 
        (is_palindrome(input) 
            ? "Phrase is a palindrome" 
            : "Phrase is not a palindrome");
    return 0;
}

我不确定为什么你要使用堆栈或双端队列来实现此目的，但如果你这样做，标准库中的那些似乎可以很好地完成这项工作。