【394. 字符串解码】辅助栈+递归（python3）

最新推荐文章于 2023-08-18 16:37:00 发布

Alwaysion

最新推荐文章于 2023-08-18 16:37:00 发布

阅读量96

点赞数

分类专栏： # DFS-树 # 基本算法文章标签：字符串 leetcode dfs python 栈

本文链接：https://blog.csdn.net/anan15151529/article/details/118293796

版权

基本算法同时被 2 个专栏收录

29 篇文章 1 订阅

订阅专栏

DFS-树

21 篇文章 0 订阅

订阅专栏

题目描述

https://leetcode-cn.com/problems/decode-string/

思路题解

辅助栈

https://leetcode-cn.com/problems/decode-string/solution/decode-string-fu-zhu-zhan-fa-di-gui-fa-by-jyd/

class Solution:
    def decodeString(self, s: str) -> str:
        stack, res, multi = [], "", 0
        for c in s:
            if c == '[':
                stack.append([multi, res])
                res, multi = "", 0
            elif c == ']':
                cur_multi, last_res = stack.pop()
                res = last_res + cur_multi * res
            elif '0' <= c <= '9':
                multi = multi * 10 + int(c)            
            else:
                res += c
        return res

在这里插入图片描述

递归

在这里插入图片描述

class Solution:
    def decodeString(self, s: str) -> str:
        def dfs(s, i):
            res, multi = "", 0
            while i < len(s):
                if '0' <= s[i] <= '9':
                    multi = multi * 10 + int(s[i]) #怕是大于1位数的所以每次乘以10
                elif s[i] == '[':
                    i, tmp = dfs(s, i + 1)
                    res += multi * tmp
                    multi = 0
                elif s[i] == ']':
                    return i, res
                else:
                    res += s[i]
                i += 1
            return res
        return dfs(s,0)