leetcode

0 class Solution {

1 public:

2 int minInsertions(string s) const {

3 const int n = size(s);

4 int res = 0, cnt = 0;

5

6 s.push_back(' ');

7 for (int i = 0; i < n; i++) {

8 if (s[i] == '(')

9 cnt++;

10 else {

11 if (cnt) {

12 if (s[i + 1] == ')')

13 i++;

14 else

15 res++;

16 cnt--;

17 } else {

18 if (s[i + 1] == ')')

19 res++, i++;

20 else

21 res += 2;

22 }

23 }

24 }

25

26 return res + cnt * 2;

27 }

28 };