fork download
  1. import java.util.Stack;
  2.  
  3. class Palindromer {
  4.  
  5. Stack<Character> stack = null;
  6.  
  7. public boolean isPalindrome(String s) {
  8. for (int i=0;i<s.length();i++) {
  9. stack = new Stack<Character>();
  10. stack.push(s.charAt(i));
  11. System.out.println(stack);
  12. }
  13. String returnString = "";
  14.  
  15. while (!stack.isEmpty()) {
  16. returnString = returnString+stack.pop();
  17. System.out.println(returnString);
  18. }
  19.  
  20. return returnString.equals(s);
  21. }
  22.  
  23. }
  24.  
  25. class PalindromeChecker {
  26. public static void main(String[] args) {
  27. Palindromer palin = new Palindromer();
  28. if (palin.isPalindrome("BananaB")) {
  29. System.out.println("is palindrome");
  30. } else {
  31. System.out.println("not a palindrome");
  32. }
  33. if (palin.isPalindrome("newbee")) {
  34. System.out.println("is palindrome");
  35. } else {
  36. System.out.println("not a palindrome");
  37. }
  38. if (palin.isPalindrome("malayalam")) {
  39. System.out.println("is palindrome");
  40. } else {
  41. System.out.println("not a palindrome");
  42. }
  43. }
  44. }
Success #stdin #stdout 0.1s 320576KB
stdin
Standard input is empty
stdout
[B]
[a]
[n]
[a]
[n]
[a]
[B]
B
not a palindrome
[n]
[e]
[w]
[b]
[e]
[e]
e
not a palindrome
[m]
[a]
[l]
[a]
[y]
[a]
[l]
[a]
[m]
m
not a palindrome