A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
help on attachment
anonymous
 5 years ago
help on attachment

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I would go for the easy way; trim all spaces on the string, and compare first place of the string to the last, make sure they're equal. then second to last1, third to last2, ... until you get to length/2. Return true if you get to length/2. false if at any point they are different. Example: able was i ere i saw elba trim ablewasiereisawelba compare: a = a? yes compare b = b? yes compare l = l? yes etc.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Apparently, I can't read, it's recursive. but same thing applies. public boolean testPalindrome(String palindrome){ if(palindrome.length() <= 1) return true; if(palindrome.chatAt(0) == palindrome.charAt(palindrome.length()1) return testPalindrome(palindrome.substring(1, palindrome.length1); else return false; } Code in Java, but it should be easy to adapt. You should do the comparison, and send to the recursive function the String minus the first and last places, then go at it again. Test for length, return true if you've reached 1 or 0 (if length was odd or even numbered), and return false if at any point they differ.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.