mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
37 lines
918 B
HTML
37 lines
918 B
HTML
<p>给你一个由若干括号和字母组成的字符串 <code>s</code> ，删除最小数量的无效括号，使得输入的字符串有效。</p>
|
||
|
||
<p>返回所有可能的结果。答案可以按 <strong>任意顺序</strong> 返回。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>s = "()())()"
|
||
<strong>输出：</strong>["(())()","()()()"]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>s = "(a)())()"
|
||
<strong>输出：</strong>["(a())()","(a)()()"]
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>s = ")("
|
||
<strong>输出：</strong>[""]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<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>
|