CTCI 1.5

Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string.

This problem is still a pointer problem. Use two pointer to record the start position and end position of a sequence of same characters. Then append the character and the number to a new string. At last, check if the new string is smaller than the original one.

/* This problem could still be classified as a pointer problem. Use to pointer to record the start position and 
end position of s consequece of same characters. Use StringBuilder to build the required string, and valueOf()
function to convert int to string

*/
public class StringCompression {
    public String stringCompression(String s) {
        StringBuilder sb = new StringBuilder();
        int i = 0, j = 0;
        while(i < s.length()) {
            while(j < s.length() && s.charAt(j) == s.charAt(i)) j++;
            sb.append(s.charAt(i));
            sb.append(String.valueOf(j-i));
            i = j;
        }

        if(sb.length() >= s.length()) return s;
        return sb.toString();
    }

    public static void main(String[] args) {
        StringCompression sc = new StringCompression();
        System.out.println(sc.stringCompression(""));
        System.out.println(sc.stringCompression("a"));
        System.out.println(sc.stringCompression("aa"));
        System.out.println(sc.stringCompression("aaa"));
        System.out.println(sc.stringCompression("aabbc"));
        System.out.println(sc.stringCompression("aaabbbcc"));
    }
}

 

转载于:https://www.cnblogs.com/pyemma/p/3826985.html