234 5 6 7 8 9 10 11 12 13 14 15 16 # 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; 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 won't be input like 3a or 2[4]. # Examples: #s="3[a]2[bc]", return "aaabcbc".
234 5 6 7 8 9 10 11 12 13 14 15 16 # 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; 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 won't be input like 3a or 2[4]. # Examples: #s="3[a]2[bc]", return "aaabcbc".
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![1
# Given an encoded string, return it's decoded string.
234
5
6
18
7
8
9
10
# Furthermore, you may assume that the original data does not contain any
11 #digits and that digits are only for those repeat numbers, k.
12
# For example, there won't be input like 3a or 2[4].
13
14
15
16 #s="3[a]2[bc]", return "aaabcbc".
17 # S = "3[a2[c]]", return "accaccacc".
19
20
21
22
23
24
25
26
27
28
18 #s="2[abc]3[cd]ef", return "abcabccdcdcdef".
29
30
31
32
# 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.
33
34
35
36
# You may assume that the input string is always valid; No extra white spaces,
# square brackets are well-formed, etc..
37
20
# Examples:
def decode_string(s):
www
:type s: str
:rtype: str
stack = []; cur_num= 0; cur_string
for c in s:
if c == '[':
stack.append((cur_string, cur_num))
cur_string
cur_num = 0
elif c == '1':
prev_string, num = stack.pop()
cur_string= prev_string + num * cur_string
elif c.isdigit():
cur_num= cur_num*10+ int (c)
else:
cur_string += c](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0294fb03-48e6-4121-9ff5-4b24572820b1%2F38af603c-7cbd-4975-ae00-2912ad3b331b%2F0fvxjw_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1
# Given an encoded string, return it's decoded string.
234
5
6
18
7
8
9
10
# Furthermore, you may assume that the original data does not contain any
11 #digits and that digits are only for those repeat numbers, k.
12
# For example, there won't be input like 3a or 2[4].
13
14
15
16 #s="3[a]2[bc]", return "aaabcbc".
17 # S = "3[a2[c]]", return "accaccacc".
19
20
21
22
23
24
25
26
27
28
18 #s="2[abc]3[cd]ef", return "abcabccdcdcdef".
29
30
31
32
# 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.
33
34
35
36
# You may assume that the input string is always valid; No extra white spaces,
# square brackets are well-formed, etc..
37
20
# Examples:
def decode_string(s):
www
:type s: str
:rtype: str
stack = []; cur_num= 0; cur_string
for c in s:
if c == '[':
stack.append((cur_string, cur_num))
cur_string
cur_num = 0
elif c == '1':
prev_string, num = stack.pop()
cur_string= prev_string + num * cur_string
elif c.isdigit():
cur_num= cur_num*10+ int (c)
else:
cur_string += c
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY