题解 | 括号匹配深度
括号匹配深度
https://www.nowcoder.com/practice/a2d5b1875bb0408384278f40d1f236c9
#include <iostream>
using namespace std;
#include<stack>
#include<string>
#include<algorithm>
int main(){
string s;
cin>>s;
stack<char>a;
int c=0;
int n=s.size();
for(int i=0;i<n;i++){
if(s[i]=='('){
a.push(s[i]);
c=max(c,(int)a.size());
}
if(s[i]==')'){
a.pop();
}
}
cout<<c;
return 0;
}
查看9道真题和解析