题解 | 括号匹配深度
括号匹配深度
https://www.nowcoder.com/practice/a2d5b1875bb0408384278f40d1f236c9
#include<bits/stdc++.h>
using namespace std;
string s;
void solve(){
int len=s.size(),ma=0;
int count=0;
for(int i=0;i<len;i++){
if(s[i]=='('){
count++;
}else{
count--;
}
ma=max(ma,count);
}
cout<<ma<<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>s;
solve();
return 0;
}
