remove-all-adjacent-duplicates-in-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a string <code>s</code> 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 <code>s</code> 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.

&nbsp;
Example 1:

<pre>
Input: s = &quot;abbaca&quot;
Output: &quot;ca&quot;
Explanation: 
For example, in &quot;abbaca&quot; we could remove &quot;bb&quot; since the letters are adjacent and equal, and this is the only possible move. The result of this move is that the string is &quot;aaca&quot;, of which only &quot;aa&quot; is possible, so the final string is &quot;ca&quot;.
</pre>

Example 2:

<pre>
Input: s = &quot;azxxzy&quot;
Output: &quot;ay&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

removeDuplicates

Remove All Adjacent Duplicates In String

Remove All Adjacent Duplicates in String II

remove-all-adjacent-duplicates-in-string-ii

删除字符串中的所有相邻重复项 II

Removing Stars From a String

removing-stars-from-a-string

从字符串中移除星号

Minimize String Length

minimize-string-length

最小化字符串长度

Stack

String

给出由小写字母组成的字符串&nbsp;<code>s</code>，重复项删除操作会选择两个相邻且相同的字母，并删除它们。

在 <code>s</code> 上反复执行重复项删除操作，直到无法继续删除。

在完成所有重复项删除操作后返回最终的字符串。答案保证唯一。

&nbsp;

示例：

<pre>
输入："abbaca"
输出："ca"
解释：
例如，在 "abbaca" 中，我们可以删除 "bb" 由于两字母相邻且相同，这是此时唯一可以执行删除操作的重复项。之后我们得到字符串 "aaca"，其中又只有 "aa" 可以执行重复项删除操作，所以最后的字符串为 "ca"。
</pre>

&nbsp;

提示：

<ol>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> 仅由小写英文字母组成。</li>
</ol>