LeetCode --- 1047. Remove All Adjacent Duplicates In String 解题报告

杨鑫newlfe

于 2022-02-03 02:25:39 发布

阅读量504

点赞数

分类专栏： Python 算法 LeetCode 文章标签： leetcode 算法 Python 面试

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/122773834

版权

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

本文介绍了LeetCode上的第1047题，题目要求从给定的字符串中删除所有相邻且相同的字母，直到无法继续删除为止。文章详细解析了解题思路和Python实现过程，并提供了最终的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them.

We repeatedly make duplicate removals on s until we no longer can.

Return the final string after all such duplicate removals have been made. It can be proven that the answer is unique.

Example 1:

Input: s = "abbaca"
Output: "ca"
Explanation: 
For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.  The r

了解本专栏