Write a program to read several lines from a file. For each line, check (recursively) whether it is a palindrome. If it is a palindrome output the original string preceded by an integer (a counter) , like this: 1 : Sore was I, ere I saw Eros. 2 : A man, a plan, a canal -- Panama Recall that a palindrome is a String that is the same backwards and forwards. Some examples of single words that are palindromes are: level, madam, racecar Phrases can also be palindromes if you strip out all the whitespace and punctuation and make everything the same case. Some examples are: Madam, I'm Adam A Toyota's a Toyota (See the palindrome video for more) You will need one method to eliminate whitespace and punctuation , make everything lowercase, and return the new string. Use the recursive method you wrote in L15Num2. This returns a string with no whitespace or punctuation, but not all the same case. Then (in main) convert that string to lowercase. You need a recursive method that takes the new string and determines whether it is a palindrome. Here is the input file: palin.txt racecar level Howdy No X in Nixon A Toyota's a Toyota Madam, I'm Adam I'm Adam Rubric: comments to say what the program does comments within the program method to eliminate whitespace, punctuation RECURSIVE palindrome method. counter
Write a
1 : Sore was I, ere I saw Eros.
2 : A man, a plan, a canal -- Panama
Recall that a palindrome is a String that is the same backwards and forwards. Some examples of single words that are palindromes are:
level, madam, racecar
Phrases can also be palindromes if you strip out all the whitespace and punctuation and make everything the same case. Some examples are:
Madam, I'm Adam
A Toyota's a Toyota
(See the palindrome video for more)
You will need one method to eliminate whitespace and punctuation , make everything lowercase, and return the new string. Use the recursive method you wrote in L15Num2. This returns a string with no whitespace or punctuation, but not all the same case. Then (in main) convert that string to lowercase.
You need a recursive method that takes the new string and determines whether it is a palindrome.
Here is the input file: palin.txt
racecar
level
Howdy
No X in Nixon
A Toyota's a Toyota
Madam, I'm Adam
I'm Adam
Rubric:
comments to say what the program does
comments within the program
method to eliminate whitespace, punctuation
RECURSIVE palindrome method.
counter
Correct output
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
