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 withB
), whereA
andB
are valid strings, or - It can be written as
(A)
, whereA
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"
Example 3:
Input: s = "))(("
Output: ""
Explanation: An empty string is also valid.
Example 4:
Input: s = "(a(b(c)d)"
Output: "a(b(c)d)"
Constraints:
1 <= s.length <= 105
s[i]
is either'('
,')'
, or lowercase English letter.
题目大意:求删除最少括号使得string合法
题目分析:用一个栈模拟下,标记不合法的位置
13ms,时间击败 87.36%
class Solution {
public boolean isSkip(char ch) {
return ch >= 'a' && ch <= 'z';
}
public String minRemoveToMakeValid(String s) {
int n = s.length(), top = 0;
char[] str = s.toCharArray();
int[] stk = new int[n + 1];
boolean[] removed = new boolean[n];
for (int i = 0; i < n; i++) {
if (isSkip(str[i])) {
continue;
} else if (str[i] == '(') {
stk[++top] = i;
} else {
if (top > 0) {
top--;
} else {
removed[i] = true;
}
}
}
for (int i = 1; i <= top; i++) {
removed[stk[i]] = true;
}
StringBuffer sb = new StringBuffer("");
for (int i = 0; i < n; i++) {
if (!removed[i]) {
sb.append(str[i]);
}
}
return sb.toString();
}
}