mirror of https://github.com/doocs/leetcode.git
14 lines
449 B
Python
14 lines
449 B
Python
class Solution:
|
|
def betterCompression(self, compressed: str) -> str:
|
|
cnt = Counter()
|
|
i, n = 0, len(compressed)
|
|
while i < n:
|
|
j = i + 1
|
|
x = 0
|
|
while j < n and compressed[j].isdigit():
|
|
x = x * 10 + int(compressed[j])
|
|
j += 1
|
|
cnt[compressed[i]] += x
|
|
i = j
|
|
return "".join(sorted(f"{k}{v}" for k, v in cnt.items()))
|