This program will classify a string as one of the following: a palindrome, a repeated word, or “nothing special”. A word is considered repeated if it repeats only once in a string (e.g., “pizzapizza”). Some palindrome examples are: “racecar”, “aa”, and “aaa”. To determine if it is a palindrome, recommend you make use of the below method. Please make sure this program works for all cases and conditions. /** * This method will return a reversed version of the input string */ static String reverseString(String inStr) { String outStr = ""; if (inStr != null) { int startIndex = inStr.length()-1; for (int i=startIndex; i >= 0; i--) { outStr = outStr + inStr.charAt(i); } } return outStr; }
This
/**
* This method will return a reversed version of the input string
*/
static String reverseString(String inStr)
{
String outStr = "";
if (inStr != null)
{
int startIndex = inStr.length()-1;
for (int i=startIndex; i >= 0; i--)
{
outStr = outStr + inStr.charAt(i);
}
}
return outStr;
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images