In a string compression technique, a string can be compressed based on the following condition.
– If a character occurs consecutively(possibly once) in the string, then those characters must be replaced with the single character and the frequency of the character till that position in the string.
For example,
aaabbcccaaabbb can be compressed as a3b2c3a6b5.
abcabcaabbcc can be compressed as a1b1c1a2b2c2a4b4c4.
The program must accept a string S representing a compressed string as the input. The program must expand the given string and print the original string as the output.
Boundary Condition(s):
2 <= Length of S <= 100
Input Format:
The first line contains S.
Output Format:
The first line contains the expanded string based on the given conditions.
Example Input/Output 1:
Input:
a3b3c3a6
Output:
aaabbbcccaaa
Explanation:
a3 -> aaa
b3 -> bbb
c3 -> ccc
a6 -> aaa (already the character ‘a‘ has occurred thrice before)
Example Input/Output 2:
Input:
x5y2z1x6y3z6
Output:
xxxxxyyzxyzzzzz
s=input().strip()
l=len(s)
ch=s[0]
d={}
i=1
n=''
while i<l:
if s[i].isalpha():
n=int(n)-d.get(ch,0)
print(ch*n,end='')
d[ch]=d.get(ch,0)+n
ch=s[i]
n=''
else:
n+=s[i]
i+=1
print(ch*(int(n)-d.get(ch,0)))Adapted From: https://github.com/kishorercse
