LeetCode 1209. Remove All Adjacent Duplicates in String II解题报告（python）

最新推荐文章于 2022-05-06 11:00:30 发布

orientliu96

最新推荐文章于 2022-05-06 11:00:30 发布

阅读量951

点赞数

分类专栏： LeetCode 文章标签： leetcode python

本文链接：https://blog.csdn.net/Orientliu96/article/details/104122423

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

1209. Remove All Adjacent Duplicates in String II

Remove All Adjacent Duplicates in String II python solution

题目描述

Given a string s, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them causing the left and the right side of the deleted substring to concatenate together.
We repeatedly make k duplicate removals on s until we no longer can.
Return the final string after all such duplicate removals have been made.
It is guaranteed that the answer is unique.
在这里插入图片描述

解析

题目比较好理解，只需要不断删除连续k个相同的元素即可。

class Solution:
    def removeDuplicates(self, s, k):
        stack = [['#', 0]]
        for c in s:
            if stack[-1][0] == c:
                stack[-1][1] += 1
                if stack[-1][1] == k:
                    stack.pop()
            else:
                stack.append([c, 1])
        return ''.join(c * k for c, k in stack)