There is two method use loops in java language Write the method mirrorEnds().
There is two method use loops in java language
Write the method mirrorEnds().
*
* Given a String str, look for a mirror image (backwards) string
* at both the beginning and end of the given string. In other words,
* zero or more characters at the very beginning of the given string,
* and at the very end of the string in reverse order (possibly
* overlapping). For example, the string "abXYZba" has the mirror
* end "ab".
*
* Examples:
* mirrorEnds("abXYZba") returns "ab"
* mirrorEnds("abca") returns "a"
* mirrorEnds("aba") returns "aba"
*
* @param str the String to search.
* @return the string that is mirrored at the end.
*/
// TODO - Write the method mirrorEnds here.
/**
* Write the method named gHappy().
*
* We'll say that a lowercase 'g' in a string is "happy"
* if there is another 'g' immediately to its left or right.
* Return true if all the g's in the given string are happy.
*
* Examples:
* gHappy("xxggxx") returns true
* gHappy("xxgxx") returns false
* gHappy("xxggyygxx") returns false
*
* @param str the String to search.
* @return true if all lowercase 'g's are happy.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
