A valid parentheses string is either empty
("")
,"(" + A + ")"
, orA + B
, whereA
andB
are valid parentheses strings, and+
represents string concatenation. For example,""
,"()"
,"(())()"
, and"(()(()))"
are all valid parentheses strings.A valid parentheses string
S
is primitive if it is nonempty, and there does not exist a way to split it intoS = A+B
, withA
andB
nonempty valid parentheses strings.Given a valid parentheses string
S
, consider its primitive decomposition:S = P_1 + P_2 + ... + P_k
, whereP_i
are primitive valid parentheses strings.Return
S
after removing the outermost parentheses of every primitive string in the primitive decomposition ofS
.
Example 1:
Input: "(()())(())" Output: "()()()" Explanation: The input string is "(()())(())", with primitive decomposition "(()())" + "(())". After removing outer parentheses of each part, this is "()()" + "()" = "()()()".Example 2:
Input: "(()())(())(()(()))" Output: "()()()()(())" Explanation: The input string is "(()())(())(()(()))", with primitive decomposition "(()())" + "(())" + "(()(()))". After removing outer parentheses of each part, this is "()()" + "()" + "()(())" = "()()()()(())".Example 3:
Input: "()()" Output: "" Explanation: The input string is "()()", with primitive decomposition "()" + "()". After removing outer parentheses of each part, this is "" + "" = "".
Note:
S.length <= 10000
S[i]
is"("
or")"
S
is a valid parentheses string
public String removeOuterParentheses(String S) {
int count = 0, l = 0, r = 0;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < S.length(); i++) {
char ch = S.charAt(i);
if (ch == '(') count++;
else count--;
if (count == 0) {
r = i;
sb.append(S.substring(l+1, r));
l = r + 1;
}
}
return sb.toString();
}