Leetcode——面试题 01.06. 字符串压缩

class Solution
{
public:
    string compressString(string S)
    {
        int lengthpre=S.length();
        int temp=0;
        string restr="";
        // S=S+S[lengthpre-1];
        string temps;
        for(int i=0;i<lengthpre;i=i+temp)
        {
            temps=S.substr(i,1);
            temp=1;
            int j=i;
            while(j<lengthpre-1&&S[j]==S[j+1])
            {
                temp++;
                j++;
            }
            temps.append(to_string(temp));
            restr+=temps;
        }
        int lengthafter=restr.length();
        if(lengthafter<lengthpre)
        {
            return restr;
        }
        else
        {
            return S.substr(0,lengthpre);
        }
    }
};