Question

Given a string, recursively compress all sets of repeating adjacent chars within an existing string to a single char. For example, "XVxzzz" yields "xyz" <pre> ceoveReaeatsl"fffaaac Quuutreturns "far Out" eoveReneatsC"nogoge wogorcriiies") returns "no worries" remaveReneats.C" Tomorrow") returns "Iomeo" s /pre Qparam stc a string of characters @return a version of the original string with all repeating adjacent sequences of the same character, reduced to a single character public static String removeRepeats (String str) { ou are forbidden to use any loops, nor String or List based methods such as "contains", or methods that use regular expressions

Answer 1

public class RemoveRepeats {

    public static String removeRepeats(String str) {
        if(str.length() <= 1) {
            return str;
        } else {
            if(str.charAt(0) == str.charAt(1)) {
                return "" + removeRepeats(str.substring(1));
            } else {
                return str.charAt(0) + removeRepeats(str.substring(1));
            }
        }
    }

    public static void main(String[] args) {
        System.out.println(removeRepeats("fffaaar Ouuut"));
        System.out.println(removeRepeats("nooooo wooorriiiies"));
        System.out.println(removeRepeats("Tomorrow"));

    }

}

far Out no worie3 Tomorow Process finished with e xit code 0