Given a string s of '(' , ')' and lowercase English characters.
Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.
Formally, a parentheses string is valid if and only if:
It is the empty string, contains only lowercase characters, or
It can be written as AB (A concatenated with B), where A and B are valid strings, or
It can be written as (A), where A is a valid string.
Example 1:
Input: s = "lee(t(c)o)de)"
Output: "lee(t(c)o)de"
Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
Example 2:
Input: s = "a)b(c)d"
Output: "ab(c)d"
1 <= s.length <= 10^5
s[i] is one of '(' , ')' and lowercase English letters.
[전략]
import java.util.*;
class Solution {
public String minRemoveToMakeValid(String s) {
Stack<Integer> openBracketIdxs = new Stack<>();
StringBuilder sb = new StringBuilder();
int sbIdx = 0;
for(char ch : s.toCharArray()){
if (ch == '(') {
openBracketIdxs.push(sbIdx);
} else if (ch == ')') {
if (openBracketIdxs.isEmpty()) {
// 앞에 '(' 이 없어서 짝이 안맞는 ')'는 삭제해야하므로 sb에 append하지않고 sbIdx를 증가시키지도 않음
continue;
} else {
openBracketIdxs.pop();
}
}
sb.append(ch);
sbIdx++;
}
while (!openBracketIdxs.isEmpty()) {
int deleteIdx = openBracketIdxs.pop();
sb.deleteCharAt(deleteIdx);
}
return sb.toString();
}
}