README_EN.md

1047. Remove All Adjacent Duplicates In String

中文文档

Description

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. 1 <= S.length <= 20000
2. S consists only of English lowercase letters.

Solutions

Python3

class Solution:
    def removeDuplicates(self, S: str) -> str:
        res = []
        for s in S:
            if not res or res[-1] != s:
                res.append(s)
            else:
                res.pop()
        return ''.join(res)

Java

class Solution {
    public String removeDuplicates(String S) {
        StringBuilder sb = new StringBuilder();
        int top = -1;
        for (int i = 0, n = S.length(); i < n; ++i) {
            char s = S.charAt(i);
            if (top == -1 || sb.charAt(top) != s) {
                sb.append(s);
                ++top;
            } else {
                sb.deleteCharAt(top);
                --top;
            }
        }
        return sb.toString();
    }
}

...