Minimum Add to Make Parentheses Valid LeetCode solution in Java

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

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0