Class Solution
-
- All Implemented Interfaces:
public final class Solution
301 - Remove Invalid Parentheses\.
Hard
Given a string
s
that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.Return all the possible results. You may return the answer in any order.
Example 1:
Input: s = "()())()"
Output: "(())()","()()()"
Example 2:
Input: s = "(a)())()"
Output: "(a())()","(a)()()"
Example 3:
Input: s = ")("
Output: ""
Constraints:
1 <= s.length <= 25
s
consists of lowercase English letters and parentheses'('
and')'
.There will be at most
20
parentheses ins
.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final List<String>
removeInvalidParentheses(String s)
-
-
Method Detail
-
removeInvalidParentheses
final List<String> removeInvalidParentheses(String s)
-
-
-
-