leetcode 443. String Compression

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.

Note:

1. All characters have an ASCII value in [35, 126].
2. 1 <= len(chars) <= 1000.

1、为了不用额外空间，那么迭代器控制删除和插入。

2、k 精准控制下一个访问的位置。

class Solution {
public:
    int compress(vector<char>& chars)
    {
        char lastchar = '!';
        int lasttime = 0;
        vector<char>::iterator begin = chars.begin();
        int k = 0;
        while (k < chars.size())
        {
            char c = chars[k];
            if (c != lastchar)
            {
                
                string lastT = "";
                if (lastchar != '!' && lasttime > 1)
                {
                    chars.erase(begin + 1, begin + lasttime);
                    lastT = to_string(lasttime);
                    for (int i = 0; i < lastT.size(); i++)
                    {
                        begin ++;
                        chars.insert(begin, lastT[i]);
                    }
                }
                if (lastchar != '!')
                {
                    begin++;
                    k = k - lasttime + lastT.size() + 1;
                }
                lasttime = 1;
                lastchar = c;
            }
            else
            {
                lasttime ++;
            }
            k++;
        }
        if (lasttime > 1)
        {
            chars.erase(begin + 1, begin + lasttime);
            string lastT = to_string(lasttime);
            for (int i = 0; i < lastT.size(); i++)
            {
                begin++;
                chars.insert(begin, lastT[i]);
            }
        }
        return chars.size();
    }
};