string_Q6

package chapter1;
/*
 * Q:given a string ,compression the string by duplicate char
 *   if compressed string not short than orignal,then return orignal string
 * E:input："aabcccc"
     output："a2b1c4"
 * S:Count the Consecutive char,and append it when different
 */
public class Q6 {
    public static String compression(String s) {
        StringBuilder compressed=new StringBuilder();
        int CountConsecutive=0;
        for(int i=0;i<s.length();i++) {
            CountConsecutive++;
            if(i+1>=s.length()||s.charAt(i)!=s.charAt(i+1)) {
                compressed.append(s.charAt(i));
                compressed.append(CountConsecutive);
                CountConsecutive=0;
            }
        }
        return compressed.length()<s.length()?compressed.toString():s;
    }

    public static void main(String[] args) {
        String str="aabcccc";
        System.out.println(compression(str));
    }

}