字符串压缩。利用字符重复出现的次数,编写一种方法,实现基本的字符串压缩功能。比如,字符串aabcccccaaa会变为a2b1c5a3。若“压缩”后的字符串没有变短,则返回原先的字符串。你可以假设字符串中只包含大小写英文字母(a至z)。
示例1:
输入:"aabcccccaaa" 输出:"a2b1c5a3"
输入:"abbccd" 输出:"abbccd" 解释:"abbccd"压缩后为"a1b2c2d1",比原字符串长度更长。
提示:
- 字符串长度在[0, 50000]范围内
思路:
1.times记录字符出现的次数
2.char_judge代表当前压缩的字符
3.如果char_judge与遍历的相同,那么times+1否则把结果添加到str1中,同时更新times与char_judge
class Solution:
def compressString(self, S: str) -> str:
if S is None:
return
times = 0
char_judge = ''
str1 = ""
for index in range(len(S)):
if S[index] == char_judge:
times = times + 1
else:
if char_judge != '':
str1 = str1 + char_judge + str(times)
times = 1
char_judge = S[index]
str1 = str1 + char_judge + str(times)
if len(str1) < len(S):
return str1
else:
return S