Question
Java string problem public class StringStaticFunctions { //recommendation: do this problem the last public static String alternate(String original) { return null; } /** * create
Java string problem
public class StringStaticFunctions {
//recommendation: do this problem the last public static String alternate(String original) { return null; }
/** * create and return a new string, with * either original's first letter at the end (e.g. "abcd" --> "bcda") * or original's last letter in the beginning (e.g. "abcd" --> "dabc") */ public static String move(String original) { return null; }
//note: this method can be useful for some other method(s) in this class public static String reverse(String original) { return null; }
/** * create and return a new string, which is a palindrome and has original as * either the first half of the palindrome (e.g. "abc" --> "abccba") * or the second half of the palindrome (e.g. "abc" --> "cbaabc") */ public static String createPalindrome(String original) { return null; }
/** * a new solution for isPalindrome * hint: consider using the reverse method */ public static boolean isPalindrome(String original) { return false; }
//add your own test code public static void main(String[] args) {
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started