题解 | 括号匹配深度

#include<bits/stdc++.h>
using namespace std;
int main(){
	string str;
	cin>>str;
	if(str.size() == 0){
		cout<<0;
		return 0;
	}
	stack<char> s;
	int count = 0;
	int maxCount = 0;
	for(int i=0;i<str.size();i++){
		char c = str[i];
		if(c == '('){
			s.push(c);
			count++;
			
		}
		if(c == ')'){
			s.pop();
			count--;
		}
		maxCount = max(count,maxCount);
	}
	cout<<maxCount<<endl;
	return 0;
}