remove-invalid-parentheses

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code> that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.

Return a list of unique strings that are valid with the minimum number of removals. You may return the answer in any order.

&nbsp;
Example 1:

<pre>
Input: s = &quot;()())()&quot;
Output: [&quot;(())()&quot;,&quot;()()()&quot;]
</pre>

Example 2:

<pre>
Input: s = &quot;(a)())()&quot;
Output: [&quot;(a())()&quot;,&quot;(a)()()&quot;]
</pre>

Example 3:

<pre>
Input: s = &quot;)(&quot;
Output: [&quot;&quot;]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 25</code></li>
	<li><code>s</code> consists of lowercase English letters and parentheses <code>&#39;(&#39;</code> and <code>&#39;)&#39;</code>.</li>
	<li>There will be at most <code>20</code> parentheses in <code>s</code>.</li>
</ul>

removeInvalidParentheses

Remove Invalid Parentheses

Valid Parentheses

valid-parentheses

有效的括号

Minimum Number of Swaps to Make the String Balanced

minimum-number-of-swaps-to-make-the-string-balanced

使字符串平衡的最小交换次数

Breadth-First Search

String

Backtracking

给你一个由若干括号和字母组成的字符串 <code>s</code> ，删除最小数量的无效括号，使得输入的字符串有效。

返回所有可能的结果。答案可以按 任意顺序 返回。

 

示例 1：

<pre>
输入：s = "()())()"
输出：["(())()","()()()"]
</pre>

示例 2：

<pre>
输入：s = "(a)())()"
输出：["(a())()","(a)()()"]
</pre>

示例 3：

<pre>
输入：s = ")("
输出：[""]
</pre>

 

提示：

<ul>
	<li><code>1 <= s.length <= 25</code></li>
	<li><code>s</code> 由小写英文字母以及括号 <code>'('</code> 和 <code>')'</code> 组成</li>
	<li><code>s</code> 中至多含 <code>20</code> 个括号</li>
</ul>