443443443

443

class Solution {
    public int compress(char[] chars) {
        int len = chars.length;
        int left = 0, write = 0;
        for(int i = 0; i < len; i++){
            if((i == len - 1) || (chars[i] != chars[i + 1])){
                chars[write++] = chars[i];
                int count = i - left + 1;
                if(count > 1){
                    int tmp = write;
                    while(count > 0){
                        chars[write++] = (char)(count%10 + '0');
                        count /= 10;
                    }
                    reverse(chars, tmp, write - 1);
                }
                left = i + 1;
            }
        }
        return write;
    }
    public void reverse(char[] chars, int left, int right){
        while(left < right){
            char tmp = chars[left];
            chars[left] = chars[right];
            chars[right] = tmp;
            left++;
            right--;
        }
    }
}