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

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> and an integer <code>k</code>, a <code>k</code> duplicate removal consists of choosing <code>k</code> adjacent and equal letters from <code>s</code> and removing them, causing the left and the right side of the deleted substring to concatenate together.

We repeatedly make <code>k</code> duplicate removals on <code>s</code> 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.

&nbsp;
Example 1:

<pre>
Input: s = &quot;abcd&quot;, k = 2
Output: &quot;abcd&quot;
Explanation: There&#39;s nothing to delete.</pre>

Example 2:

<pre>
Input: s = &quot;deeedbbcccbdaa&quot;, k = 3
Output: &quot;aa&quot;
Explanation: 
First delete &quot;eee&quot; and &quot;ccc&quot;, get &quot;ddbbbdaa&quot;
Then delete &quot;bbb&quot;, get &quot;dddaa&quot;
Finally delete &quot;ddd&quot;, get &quot;aa&quot;</pre>

Example 3:

<pre>
Input: s = &quot;pbbcggttciiippooaais&quot;, k = 2
Output: &quot;ps&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>2 &lt;= k &lt;= 104</code></li>
	<li><code>s</code> only contains lowercase English letters.</li>
</ul>

removeDuplicates

Remove All Adjacent Duplicates in String II

Remove All Adjacent Duplicates In String

remove-all-adjacent-duplicates-in-string

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

Replace Non-Coprime Numbers in Array

replace-non-coprime-numbers-in-array

替换数组中的非互质数

Minimize String Length

minimize-string-length

最小化字符串长度

Stack

String

给你一个字符串&nbsp;<code>s</code>，「<code>k</code> 倍重复项删除操作」将会从 <code>s</code>&nbsp;中选择&nbsp;<code>k</code>&nbsp;个相邻且相等的字母，并删除它们，使被删去的字符串的左侧和右侧连在一起。

你需要对&nbsp;<code>s</code>&nbsp;重复进行无限次这样的删除操作，直到无法继续为止。

在执行完所有删除操作后，返回最终得到的字符串。

本题答案保证唯一。

&nbsp;

示例 1：

<pre>输入：s = &quot;abcd&quot;, k = 2
输出：&quot;abcd&quot;
解释：没有要删除的内容。</pre>

示例 2：

<pre>输入：s = &quot;deeedbbcccbdaa&quot;, k = 3
输出：&quot;aa&quot;
解释： 
先删除 &quot;eee&quot; 和 &quot;ccc&quot;，得到 &quot;ddbbbdaa&quot;
再删除 &quot;bbb&quot;，得到 &quot;dddaa&quot;
最后删除 &quot;ddd&quot;，得到 &quot;aa&quot;</pre>

示例 3：

<pre>输入：s = &quot;pbbcggttciiippooaais&quot;, k = 2
输出：&quot;ps&quot;
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 10^5</code></li>
	<li><code>2 &lt;= k &lt;= 10^4</code></li>
	<li><code>s</code>&nbsp;中只含有小写英文字母。</li>
</ul>