-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdecode-string.py
More file actions
58 lines (52 loc) · 1.45 KB
/
Copy pathdecode-string.py
File metadata and controls
58 lines (52 loc) · 1.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
class Solution:
def decodeString(self, s: str) -> str:
n = len(s)
stack = []
digits = set([str(x) for x in range(0, 10)])
for i in range(0, n):
if s[i] == "]":
curr = stack.pop()
string = ""
while curr != "[":
string = curr + string
curr = stack.pop()
multiplier = ""
while stack and stack[-1] in digits:
multiplier = stack.pop() + multiplier
multiplier = int(multiplier)
for j in range(0, multiplier):
stack.append(string)
elif s[i] != "]":
stack.append(s[i])
return "".join(stack)
# digits = set()
# for i in range(0, 10):
# digits.add(str(i))
# i = 0
# n = len(s)
# res = ""
# while i < n:
# if s[i] in digits:
# multiplier = ""
# while s[i] in digits and s[i] != "[":
# multiplier+=s[i]
# i+=1
# multiplier = int(multiplier)
# i+=1
# string=""
# while s[i] != "]":
# string+=s[i]
# i+=1
# i+=1
# for j in range(0, multiplier):
# res+=string
# # stack = []
# else:
# res+=s[i]
# i+=1
# return res
# for char in s:
solution = Solution()
print(solution.decodeString("3[a]2[bc]"))
print(solution.decodeString("3[a2[c]]"))
print(solution.decodeString("2[abc]3[cd]ef"))