Question

[C++] Need help finishing a Palindrome Checking Function

The function takes in a string and each individual character is stored in a stack. The stack is then checked to see if it is a palindrome.

This is what I have so far:

void palindromeCheck(string s){

stack myStack;

char c;

// converts string to individual chars and stored in stack

for (int i = 0; i < s.size(); i++){

c = s.at(i);

myStack.push(c);

}

// Palindrome check on stack ?

}

  

Answer 1

#include <iostream>
#include <stack>

using namespace std;

bool palindromeCheck(string s) {
    stack<char> myStack;
    char c;
// converts string to individual chars and stored in stack
    for (int i = 0; i < s.size(); i++) {
        c = s.at(i);
        myStack.push(c);
    }

    for (int i = 0; i < s.size(); i++) {
        if (myStack.top() != s[i]) {
            return false;
        }
        myStack.pop();
    }
    return true;
}

int main() {
    cout << palindromeCheck("madam") << endl;
    cout << palindromeCheck("radar") << endl;
    cout << palindromeCheck("Hi") << endl;
    cout << palindromeCheck("palindrome") << endl;
    return 0;
}