1047. Remove All Adjacent Duplicates In String

最新推荐文章于 2022-11-10 10:12:11 发布

原创最新推荐文章于 2022-11-10 10:12:11 发布 · 344 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#stack #string

博客围绕对字符串进行重复项删除展开，通过不断删除相邻重复字母，直至无法删除，保证结果唯一。给出示例，如输入“abbaca”，经多次删除后输出“ca”，并介绍使用栈的方法来实现该操作。

1047. Remove All Adjacent Duplicates In String

方法1: stack

Given a string S of lowercase 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 is guaranteed the answer is unique.

Example 1:

Input: “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 result of this move is that the string is “aaca”, of which only “aa” is possible, so the final string is “ca”.

Note:

1 <= S.length <= 20000
S consists only of English lowercase letters.

方法1: stack

class Solution {
public:
    string removeDuplicates(string S) {
        string result;
        for (char c: S) {
            if (result.empty() || result.back() != c) result.push_back(c);
            else if (!result.empty()) result.pop_back();
        }
        return result;
    }
};