LAB D - return str2; } } import java.util.Scanner; public...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
public class Palindrome { public static boolean checkPalindrome (String str) { int bound; String s = ignore (str); Stack <Character> myPalindrome = new Stack <Character>(); for ( int i = 0; i < s.length()/2 ; i++) { myPalindrome.push(s.charAt(i)); } // Different cases for even and odd string length. if (s.length() % 2 == 0) bound = s.length()/2; else bound = s.length()/2 + 1; for ( int i = bound; i < s.length() & !myPalindrome.isEmpty(); i+ +) { if (s.charAt(i) != myPalindrome.peek()) return false ; myPalindrome.pop(); } return true ; } // Ignore spaces and convert String to LowerCase public static String ignore (String str){ String str2 = new String(); str2 = str.toLowerCase().replaceAll( "\\W" , "" );
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: return str2; } } import java.util.Scanner; public class PalindromeTest extends Palindrome { public static void main(String args) { Scanner scan = new Scanner(System. in ); System. out .println( &quot;******* START *******&quot; ); while ( true ) { System. out .print( &quot;Please enter a line to check if it is a palindrome: &quot; ); String str = scan.nextLine(); if ( checkPalindrome (str) || (str.length() == 1)) System. out .println( &quot;*** &quot; + str + &quot; is a palindrome *** &quot; ); else { System. out .println( &quot;*** &quot; + str + &quot; is NOT a palindrome *** &quot; + &quot;\n&quot; ); System. out .println( &quot;***** END OF THE TEST *****&quot; ); break ; } } } }...
View Full Document

Ask a homework question - tutors are online