1021. Remove Outermost Parentheses

#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 = P_1 + P_2 + … + P_k, where P_i 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: “(()())(())”
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 “()()” + “()” + “()(())” = “()()()()(())”.

这种括号对称类的问题，可以用一个数组来记录出现的次数，最后可以发现其中的规律。比如本题，从0开始，遇到左括号就+1，右括号-1。最后观察0出现的位置，即可。

var removeOuterParentheses = function(S) {
    var indexArr = new Array();
    var indexcount = 0;
    var result = "";
    for(var i=0;i<S.length;i++) {
        if(S[i]==="(") {
            indexcount++;
            indexArr[i]=indexcount;
        }
        else {
            indexcount--;
            indexArr[i]=indexcount;
        }
    }
    for(var j=1;j<indexArr.length;j++) {
        if(indexArr[j]==0) {

        }
        else if(indexArr[j]==1&&indexArr[j-1]==0) {

        }
        else {
            result=result+S[j];
        }
    }
    return result;
};