Leetcode 394. Decode String

Given an encoded string, return it’s 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; 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”.
s = “3[a2[c]]”, return “accaccacc”.
s = “2[abc]3[cd]ef”, return “abcabccdcdcdef”.

这道题有点像数据结构学过的解析计算器，主要用的是“栈”的方法。

我的思路就是：
逐位检查，如果该位的字符是数字，那么就存到num里面，如果遇到“[”,说明数字读取完成了，所以就把数字存到栈里面去，如果遇到“]”,说明 字符串读取完成了，就把栈顶的数字取出来，然后做乘法，如果遇到其他的字符，就说明是字符串，我就把它放到字符串的栈顶中去。

同时我利用了python的一些特性，使用了一个二维列表，一维用来存字符串，一维用来存数组。最后贴下代码：

class Solution(object):
    def decodeString(self, s):
        stack = []
        stack.append(['', 1])
        num = ''
        for ch in s:
            if ch.isdigit():
                num += ch
            elif ch == '[':
                stack.append(['', int(num)])
                num = ''
            elif ch == ']':
                string, times = stack.pop()
                string = string * times
                stack[-1][0] += string
            else:
                stack[-1][0] += ch
        return stack[0][0]