题目描述
删除最小数量的无效括号,使得输入的字符串有效,返回所有可能的结果。
说明: 输入可能包含了除 ( 和 ) 以外的字符。
示例 1:
输入: “()())()”
输出: ["()()()", “(())()”]
示例 2:
输入: “(a)())()”
输出: ["(a)()()", “(a())()”]
示例 3:
输入: “)(”
输出: [""]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-invalid-parentheses
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路
class Solution {
private Set<String> res = new HashSet<>();
private char[] charArray;
private int len;
public List<String> removeInvalidParentheses(String s) {
this.charArray= s.toCharArray();
this.len = s.length();
int leftRemove = 0,rightRemove = 0;
for(int i = 0;i < len;++i){
if(charArray[i] == '('){
leftRemove++;
}else if(charArray[i] == ')'){
if(leftRemove == 0){
rightRemove++;
}else if(leftRemove > 0){
leftRemove--;
}
}
}
StringBuilder path = new StringBuilder();
dfs(0,leftRemove,rightRemove,0,0,path);
return new ArrayList<>(this.res);
}
public void dfs(int index,int leftRemove,int rightRemove,int leftCount,int rightCount,StringBuilder path){
if(index == len){
if(leftRemove == 0 && rightRemove == 0){
res.add(path.toString());
}
return;
}
char ch = charArray[index];
if(ch == '(' && leftRemove > 0){
dfs(index+1,leftRemove-1,rightRemove,leftCount,rightCount,path);
}
if(ch == ')' && rightRemove > 0){
dfs(index+1,leftRemove,rightRemove-1,leftCount,rightCount,path);
}
path.append(ch);
if(ch != '(' && ch != ')'){
dfs(index+1,leftRemove,rightRemove,leftCount,rightCount,path);
}else if(ch == '('){
dfs(index+1,leftRemove,rightRemove,leftCount+1,rightCount,path);
}else if(leftCount > rightCount){
dfs(index+1,leftRemove,rightRemove,leftCount,rightCount+1,path);
}
path.deleteCharAt(path.length()-1);
}
}