Trie简单朴树的案例-算法字符匹配(高效率)_攻城狮_Dream的博客

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10 ;
int son[N][26] ,idx;
int cnt[N],n;
void insert(string a ){
	int level =  0;
	for(int i = 0 ; i < a.size(); i++){
		int count  = a[i] - 'a';
		if(son[level][count] == 0) son[level][count] = ++idx;
		level = son[level][count] ;
	}
	cnt[level] ++;
}
int q(string a){
	int level = 0 ;
	for(int i = 0 ; i < a.size() ; i++){
		int count = a[i] - 'a';
		if(son[level][count] == 0) return 0;
		else level =son[level][count];
	}
	return cnt[level];
}
int main(){
	cin >> n; 
	while( n-- ){
		string a,b;
		cin >> a >> b;
		if( a == "I") insert(b);
		if( a == "Q") cout << q(b)<<endl;
	}
	return 0;
}#include<bits/stdc++.h>
using namespace std;
co