欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

443. String Compression

程序员文章站 2024-03-13 22:17:58
...

字符压缩题目,

class Solution {
public:
    
    
    int compress(vector<char>& chars) {
        int ii = 0;
        int count = 1;
        char now = chars[0];
        vector<char> res1;
        vector<int> res2;
        for (int ii=1;ii<chars.size();ii++){
            if (chars[ii]==now){
                count ++;
            }
            else{
                res1.push_back(now);
                res2.push_back(count);
                now = chars[ii];
                count = 1;
            }
        }
        res1.push_back(now);
        res2.push_back(count);
        
        // print
        chars.clear();
        for(int i=0;i<res1.size();i++){
            char s1 = res1[i];
            chars.push_back(s1);
            int s2 = res2[i];
            if (s2 > 1){
                string s22 = to_string(s2);
                for (int jj=0;jj<s22.size();jj++){
                    chars.push_back(s22[jj]);
                }
            }
        }
        
        return chars.size();
    }
};
相关标签: leetcode leetcode