package Lect29Library;

import java.util.*;

public class StackExample {
	public String computeReverse(String str) {
		Stack stack = new Stack();
		
		// Push the characters on the stack.
		// We cannot place primitives in the stack therefore 
		// we need Character wrapper.
		for (int i=0; i<str.length(); i++) {
			stack.push(new Character(str.charAt(i)));
		}
		
		// Generate the reverse string by popping characters.
		char[] reverseArray = new char[str.length()];
		int index = 0;
		while (!stack.empty()) {
			Character character = (Character)stack.pop();
			reverseArray[index++] = character.charValue();
		}
		
		return new String(reverseArray);
	}
	
	public boolean isPalindrome(String str) {
		String reverseString = computeReverse(str);
		
		return reverseString.equals(str);
	}
	
	public StackExample() {
		String word = new String("racecar");
		if (isPalindrome(word)) {
			System.out.println(word + " is a palindrome.");
		} else {
			System.out.println(word + " is not a palindrome.");
		}
	}
	
	public static void main(String[] args) {
		StackExample test = new StackExample();
	}
}