Complete the isPalindrome method to recursively determine whether the parameter str is a palindrome. import java.util.*; public class PalindromeDetector{ public static boolean isPalindrome(String str){ /********************************** * WRITE THIS METHOD **********************************/ return false; //temporary statement to allow compilation } public static void main(String[] args){ List allWords = new ArrayList(); Scanner input = new Scanner(
Complete the isPalindrome method to recursively determine whether the parameter str is a palindrome.
import java.util.*;
public class PalindromeDetector{
public static boolean isPalindrome(String str){ /**********************************
* WRITE THIS METHOD
**********************************/
return false; //temporary statement to allow compilation
}
public static void main(String[] args){
List<String> allWords = new ArrayList<String>();
Scanner input = new Scanner(System.in);
System.out.println("Enter a string, 0 to quit");
String str = input.nextLine();
while (!str.equals("0")){
allWords.add(str);
System.out.println("Enter a string, 0 to quit");
str = input.nextLine();
}
List<String> palindromes = new ArrayList<String>();
for (String test : allWords)
{
if (isPalindrome(test.toUpperCase())){
palindromes.add(test);
}
}
Collections.sort(palindromes);
if (!palindromes.isEmpty()){
System.out.println("Your palindromes are:"); System.out.println(palindromes);
}
else{ System.out.println("No palindromes in your input");
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
