【LeetCode】面试题 01.06. 字符串压缩（Java）

字符串压缩。利用字符重复出现的次数，编写一种方法，实现基本的字符串压缩功能。比如，字符串aabcccccaaa会变为a2b1c5a3。若“压缩”后的字符串没有变短，则返回原先的字符串。你可以假设字符串中只包含大小写英文字母（a至z）。

解法一

暴力破解

class Solution {
    public String compressString(String S) {
        char current = '*';   //当前的字符
        int count = 0;  //记录当前字符出现的次数
        StringBuilder sb = new StringBuilder();

        for (char c : S.toCharArray()) {
            //重复
            if (c == current){
                count++;
            } 
            //不重复
            else {
                //初始赋值
                if (sb.length() == 0) {
                    count = 1;
                    current = c;
                    sb.append(current);
                    continue;
                }

                sb.append(count);
                count = 1;
                current = c;
                sb.append(current);
            }
        }
        sb.append(count);

        return sb.length() < S.length() ? sb.toString() : S;
    }
}

解法二

双指针

class Solution {
    public String compressString(String S) {
        if (S.length() == 0) return S;

        //双指针
        int start = 0, end = 0;
        char[] ch = S.toCharArray();
        StringBuilder sb = new StringBuilder();
        sb.append(ch[0]);

        while (end < ch.length) {
            if (ch[start] == ch[end]) {
                end++;
            } else {
                sb.append(end - start);
                sb.append(ch[end]);
                start = end;
                end++;
            }
        }
        sb.append(end - start);

        return sb.length() < S.length() ? sb.toString() : S;
    }
}