-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdecode_string.py
64 lines (55 loc) · 2.1 KB
/
decode_string.py
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
59
60
61
62
63
64
'''
Given an encoded string, return its decoded string.
The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.
You may assume that the input string is always valid; there are no extra white spaces, square brackets are well-formed, etc. Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there will not be input like 3a or 2[4].
The test cases are generated so that the length of the output will never exceed 105.
'''
class Solution:
def decodeString(self, s):
if not s or len(s) == 0:
return s
result, position = self.dfs(0,s,0,'')
return result
def dfs(self, position, s, prev_num, prev_str):
while position < len(s):
while s[position].isdigit():
prev_num = prev_num*10 + int(s[position])
position += 1
if s[position] == "[":
#reset the prev_str
returned_str, ending_pos = self.dfs(position+1, s, prev_num=0, prev_str="")
#backtrack
prev_str = prev_str + returned_str*prev_num
position = ending_pos
prev_num = 0
#return the result
elif s[position] == ']':
return prev_str, position
else:
prev_str += s[position]
position += 1
return prev_str, position
-------------------------------------------------------------------------------------------------
class Solution:
def decodeString(self, s: str) -> str:
stack = list()
res = ''
curnum = 0
for ch in s:
if ch == '[':
stack.append(res)
stack.append(curnum)
res = ''
curnum = 0
elif ch == ']':
num = stack.pop()
prevString = stack.pop()
res = prevString + num*res
elif ch.isdigit():
print('curnum before ' + str(curnum))
curnum = curnum*10 + int(ch)
print('curnum: ' + str(curnum))
else:
res += ch
print(res)
return res