字符串压缩。利用字符重复出现的次数,编写一种方法,实现基本的字符串压缩功能。比如,字符串aabcccccaaa
会变为a2b1c5a3
。若“压缩”后的字符串没有变短,则返回原先的字符串。你可以假设字符串中只包含大小写英文字母(a至z)。
示例1:
输入:"aabcccccaaa" 输出:"a2b1c5a3"
示例2:
输入:"abbccd" 输出:"abbccd" 解释:"abbccd"压缩后为"a1b2c2d1",比原字符串长度更长。
提示:
- 字符串长度在[0, 50000]范围内。
双指针遍历字符串求解。
class Solution:
def compressString(self, S: str) -> str:
if len(S) < 2:
return S
p, q = 0, 1
res = ''
while q < len(S):
if S[p] != S[q]:
res += (S[p] + str(q - p))
p = q
q += 1
res += (S[p] + str(q - p))
return res if len(res) < len(S) else S
class Solution {
public String compressString(String S) {
int n;
if (S == null || (n = S.length()) < 2) {
return S;
}
int p = 0, q = 1;
StringBuilder sb = new StringBuilder();
while (q < n) {
if (S.charAt(p) != S.charAt(q)) {
sb.append(S.charAt(p)).append(q - p);
p = q;
}
++q;
}
sb.append(S.charAt(p)).append(q - p);
String res = sb.toString();
return res.length() < n ? res : S;
}
}
/**
* @param {string} S
* @return {string}
*/
var compressString = function(S) {
if (!S) return S;
let p = 0, q = 1;
let res = '';
while (q < S.length) {
if (S[p] != S[q]) {
res += (S[p] + (q - p));
p = q;
}
++q;
}
res += (S[p] + (q - p));
return res.length < S.length ? res : S;
};
func compressString(S string) string {
n := len(S)
if n == 0 {
return S
}
var builder strings.Builder
pre, cnt := S[0], 1
for i := 1; i < n; i++ {
if S[i] != pre {
builder.WriteByte(pre)
builder.WriteString(strconv.Itoa(cnt))
cnt = 1
} else {
cnt++
}
pre = S[i]
}
builder.WriteByte(pre)
builder.WriteString(strconv.Itoa(cnt))
if builder.Len() >= n {
return S
}
return builder.String()
}