【leetcode】【easy】【每日一题】面试题 01.06. Compress String LCCI

面试题 01.06. Compress String LCCI

Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a - z).

Example 1:

Input: "aabcccccaaa"
Output: "a2b1c5a3"

Example 2:

Input: "abbccd"
Output: "abbccd"
Explanation: 
The compressed string is "a1b2c2d1", which is longer than the original string.

Note:

1. 0 <= S.length <= 50000

题目链接：https://leetcode-cn.com/problems/compress-string-lcci/

 

思路

非常简单的题，模拟机器处理过程，一步一步做即可。

class Solution {
public:
    string compressString(string S) {
        int len = S.size();
        if(len==0) return S;
        string res = "";
        int cnt = 1;
        char ch = S[0];
        for(int i=1; i<len; ++i){
            if(S[i]==ch){
                ++cnt;
            }else{
                res += ( ch + to_string(cnt));
                ch = S[i];
                cnt = 1;
            }
        }
        res += (ch + to_string(cnt));
        return (res.size()<len)?res:S;
    }
};