443. String Compression

Given an array of characters, compress it in-place.

The length after compression must always be smaller than or equal to the original array.

Every element of the array should be a character (not int) of length 1.

After you are done modifying the input array in-place, return the new length of the array.

 

Follow up:
Could you solve it using only O(1) extra space?

 

Example 1:

Input:
["a","a","b","b","c","c","c"]

Output:
Return 6, and the first 6 characters of the input array should be: ["a","2","b","2","c","3"]

Explanation:
"aa" is replaced by "a2". "bb" is replaced by "b2". "ccc" is replaced by "c3".

 

Example 2:

Input:
["a"]

Output:
Return 1, and the first 1 characters of the input array should be: ["a"]

Explanation:
Nothing is replaced.

 

Example 3:

Input:
["a","b","b","b","b","b","b","b","b","b","b","b","b"]

Output:
Return 4, and the first 4 characters of the input array should be: ["a","b","1","2"].

Explanation:
Since the character "a" does not repeat, it is not compressed. "bbbbbbbbbbbb" is replaced by "b12".
Notice each digit has it's own entry in the array.

class Solution {
public:
    
    int compress(vector<char>& chars) {
        int i,len=chars.size(),j,ans=0,cnt=0;
        char tmp;
        for(i=0;i<len;i++){
            ans++;//最后返回的字长+1
            tmp=chars[i];
            cnt=0;
            for(j=i+1;j<len&&chars[j]==tmp;j++){//连续相同的个数
                cnt++;
            }
            for(j=0;j<cnt;j++){
                chars.erase(chars.begin()+i+1);//删除连续相同的
                len--;//既然前面删除了，那么向量长度肯定要减小
            }
            if(cnt>0){
                string cou=to_string(cnt+1);
                ans=ans+cou.length();//最后返回的字长+数字位数
                len=len+cou.length();
                for(j=0;j<cou.length();j++){
                    chars.insert(chars.begin()+i+j+1,cou[j]);//插入数字字符
                }
                i=i+cou.length();//....跳过插入的数字字符
            }
        }
        return ans;
    }
};

其实不用erase，直接跳过即可，这样更快

class Solution {
public:
    
    int compress(vector<char>& chars) {
        int i,len=chars.size(),j,ans=0,cnt=0;
        int num=0;
        char tmp;
        for(i=0;i<len;i++){
            ans++;
            tmp=chars[i];
            cnt=0;
            for(j=i;j<len&&chars[j]==tmp;j++){
                cnt++;
            }
            int index=j;
            chars[num++]=chars[i];
            if(cnt>1){
                string cou=to_string(cnt);
                ans=ans+cou.length();
                for(j=0;j<cou.length();j++){
                    chars[num++]=cou[j];
                }
            }
            i=index-1;
        }
        return ans;
    }
};