https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
class Solution {
public:
int minAddToMakeValid(string S) {
stack<char> s;
int res = 0;
for(auto c:S){
if(c=='('){
s.push('(');
}
else{//右括号
if(!s.empty()){
s.pop();
}
else{//没有做括号匹配
res+=1;
}
}
}
return res+s.size();
}
};