strp = input()
ans = ''
lt = i = len(strp)
i = lt - 1
stack = []
r = 0
while i >= 0:
if strp[i] == ']':
r += 1
if r == 0:
ans = strp[i] + ans
else:
if strp[i] != '[':
stack.append(strp[i])
else:
num = 0
if ord(stack[-2]) >= ord('0') and ord(stack[-2]) <= ord('9'):
num = int(stack[-1] + stack[-2])
stack = stack[:-2]
else:
num = int(stack[-1])
stack.pop()
new = []
k = -1
while stack[k] != ']':
k -= 1
stack = stack[:k] + stack[k+1:]*num
r -= 1
if r == 0:
ans = ''.join(reversed(stack)) + ans
stack = []
i -= 1
print(ans)
洛谷\P1464 Function\栈模拟\Python
最新推荐文章于 2024-07-10 23:54:36 发布
![](https://img-home.csdnimg.cn/images/20240709112858.png)