Minimum Insertions to Balance a Parentheses String

Given a parentheses string s containing only the characters '(' and ')'. A parentheses string is balanced if:

• Any left parenthesis '(' must have a corresponding two consecutive right parenthesis '))'.
• Left parenthesis '(' must go before the corresponding two consecutive right parenthesis '))'.

In other words, we treat '(' as an opening parenthesis and '))' as a closing parenthesis.

• For example, "())", "())(())))" and "(())())))" are balanced, ")()", "()))" and "(()))" are not balanced.

You can insert the characters '(' and ')' at any position of the string to balance it if needed.

Return the minimum number of insertions needed to make s balanced.

Example 1:

Input: s = "(()))"
Output: 1
Explanation: The second '(' has two matching '))', but the first '(' has only ')' matching. We need to to add one more ')' at the end of the string to be "(())))" which is balanced.

Example 2:

Input: s = "())"
Output: 0
Explanation: The string is already balanced.

思路：这题跟Minimum Add to Make Parentheses Valid 一模一样，唯一不一样的就是右边是两个括号，然后要特殊判断一下连续的2个括号的情况；另外 count < 0，的时候，一定是出现了两个右括号的情况，这时候要左括号++；最后如果count还存在，那说明还有count的左括号；res += 2*count;

class Solution {
    public int minInsertions(String s) {
        if(s == null || s.length() == 0) {
            return 0;
        }
        int count = 0;
        int step = 0;
        for(int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if(c == '(') {
                count++;
            } else {
                if(i + 1 < s.length() && s.charAt(i + 1) == ')') {
                    count--;
                    i++;
                } else {
                    step++; // add );
                    count--;
                }
            }
            if(count < 0) { // count--,肯定有两个)), 加入左括号；
                step++;
                count = 0;
            }
        }
        return step + count * 2; // 如果有count，证明还有左括号，需要2个右括号匹配；
    }
}