Class Solution
java.lang.Object
g0301_0400.s0301_remove_invalid_parentheses.Solution
301 - Remove Invalid Parentheses.<p>Hard</p>
<p>Given a string <code>s</code> that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.</p>
<p>Return <em>all the possible results</em>. You may return the answer in <strong>any order</strong>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “()())()”</p>
<p><strong>Output:</strong> [“(())()”,“()()()”]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “(a)())()”</p>
<p><strong>Output:</strong> [“(a())()”,“(a)()()”]</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> s = “)(”</p>
<p><strong>Output:</strong> [""]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 25</code></li>
<li><code>s</code> consists of lowercase English letters and parentheses <code>'('</code> and <code>')'</code>.</li>
<li>There will be at most <code>20</code> parentheses in <code>s</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
removeInvalidParentheses
-