921. Minimum Add to Make Parentheses Valid

Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting parentheses string is valid.

Formally, a parentheses string is valid if and only if:

  • It is the empty string, or
  • It can be written as AB (A concatenated with B), where A and B are valid strings, or
  • It can be written as (A), where A is a valid string.

Given a parentheses string, return the minimum number of parentheses we must add to make the resulting string valid.

 

Example 1:

Input: "())"
Output: 1

Example 2:

Input: "((("
Output: 3

Example 3:

Input: "()"
Output: 0

Example 4:

Input: "()))(("
Output: 4

 1 class Solution {
 2     public int minAddToMakeValid(String S) {
 3         int count= 0;
 4         int addedCount = 0;
 5         for (int i = 0; i < S.length(); ++i) {
 6             if (S.charAt(i) == '(') {
 7                 count++;
 8             } else {
 9                 count--;
10             }
11             if (count < 0) {
12                 addedCount += -count;
13                 count = 0;
14             }
15         }
16         return addedCount + count;
17     }
18 }

 

posted @ 2021-03-29 05:13  北叶青藤  阅读(37)  评论(0编辑  收藏  举报