LeetCode 1021. Remove Outermost Parentheses

A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B 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 into s = A + B, with A and B nonempty valid parentheses strings.

Given a valid parentheses string s, consider its primitive decomposition: s = P1 + P2 + ... + Pk, where Pi are primitive valid parentheses strings.

Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s.

Example 1:

Input: s = "(()())(())"
Output: "()()()"
Explanation: 
The input string is "(()())(())", with primitive decomposition "(()())" + "(())".
After removing outer parentheses of each part, this is "()()" + "()" = "()()()".

Example 2:

Input: s = "(()())(())(()(()))"
Output: "()()()()(())"
Explanation: 
The input string is "(()())(())(()(()))", with primitive decomposition "(()())" + "(())" + "(()(()))".
After removing outer parentheses of each part, this is "()()" + "()" + "()(())" = "()()()()(())".

Example 3:

Input: s = "()()"
Output: ""
Explanation: 
The input string is "()()", with primitive decomposition "()" + "()".
After removing outer parentheses of each part, this is "" + "" = "".

Constraints:

• 1 <= s.length <= 105
• s[i] is either '(' or ')'.
• s is a valid parentheses string.

---

最直观的想法就是用stack来push/pop左右括号，每次遍历完一个primitive parenthese就造一次string，把所有processed primitives都放进一个list，最后把list里所有string合一起就是答案了。

class Solution {
    public String removeOuterParentheses(String s) {
        List<String> list = new ArrayList<>();
        StringBuilder sb = new StringBuilder();
        Deque<Character> stack = new ArrayDeque<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (c == '(') {
                stack.push('(');
            } else {
                stack.pop();
            }
            sb.append(c);

            if (stack.isEmpty()) {
                list.add(sb.substring(1, sb.length() - 1).toString());
                sb = new StringBuilder();
            }
        }
        for (String str : list) {
            sb.append(str);
        }
        return sb.toString();
    }
}

然后看了答案发现根本不需要这么复杂……直接一个int存open parenthese就可以了……每次遇到左括号就++，遇到右括号就--，当open == 0的时候就说明一个primitive完成了。那么针对要去掉最前和最后的左右括号，那就在遇到左括号时判断当前的open是不是第一个，遇到右括号时判断当前的open是不是最后一个，就完事了。

class Solution {
    public String removeOuterParentheses(String s) {
        StringBuilder sb = new StringBuilder();
        int open = 0;
        for (char c : s.toCharArray()) {
            if (c == '(') {
                if (open > 0) {
                    sb.append(c);
                }
                open++;
            } else {
                if (open > 1) {
                    sb.append(c);
                }
                open--;
            }
        }
        return sb.toString();
    }
}