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".

Reference Answer

思路分析

看到括号匹配的题肯定想到用栈去做。
这个题，遇到 ’[‘ 就把之前的字符串进行进栈操作。遇到 ’]’ 进行出栈操作。
curstring保存的是出栈操作完成后的字符串。

注意这一步：curstring = prestring + prenum * curstring，prestring是前面的字符串，prenum * curstring是这一步骤结束之后的字符串，所以是：前面的字符串+现在的字符串得到目前已有的字符串。

这种问题明显不是靠多重遍历得到结果，注意堆栈的使用。

Code

class Solution:
    def decodeString(self, s):
        """
        :type s: str
        :rtype: str
        """
        temp_res = []
        cur_str = ''
        cur_num = 0
        for char in s:
            if char == '[':
                temp_res.append(cur_str)
                temp_res.append(cur_num)
                cur_str = ''
                cur_num = 0
            elif char == ']':
                pre_num = temp_res.pop()
                pre_str = temp_res.pop()
                cur_str = pre_str + pre_num * cur_str
            elif char.isdigit():
                cur_num = cur_num * 10 + int(char)
            else:
                cur_str += char
                
        return cur_str
        

Note

• 看到括号匹配的题肯定想到用栈去做， 尤其是这种只存在一种符号，不存在优先级冲突的情况！

参考文献

[1] https://blog.csdn.net/fuxuemingzhu/article/details/79332894