>The following method returns the longest substring that appears at both the beginning and the end of the string without overlap. For example, sameEnds("abXab") returns "ab".
Exercise 3.8
>The following method returns the longest substring that appears at both the beginning and the end of the string without overlap. For example, sameEnds("abXab") returns "ab".
public class SameEnds {
public String sameEnds(String string) {
int length = string.length();
int half = length / 2;
String left = "";
String right = "";
int size = 0;
for (int i = 0; i < half; i++) {
left = left + string.charAt(i);
right = string.charAt(length - 1 - i) + right;
if (left.equals(right)) {
size = left.length();
}
}
return string.substring(0, size);
}
}
This is a software testing exercise. Apply the domain testing to the above program. Clearly state all steps of domain testing.
Thank you so much.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
