数据结构--字典树

先读入n个字符串，查找某个串出现次数

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define ll long long
const int N = 1e5 + 7;

int son[N][26],cnt[N],idx;

void insert(string s) {
	int len_s = s.size();
	int p = 0;
	for(int i = 0; i < len_s; i++) {
		int u = s[i] - 'a';
		if(son[p][u] == 0) {
			son[p][u] = ++idx;
		}
		p = son[p][u];
	}
	cnt[p]++;
}

int quick(string s) {
	int len_s = s.size();
	int p = 0;
	for(int i = 0; i < len_s; i++) {
		int u = s[i] - 'a';
		if(son[p][u] == 0)
			return 0;
		p = son[p][u];
	}
	return cnt[p];
}

int main() {
	int n;
	cin >> n;
	while(n--) {
		string s;
		cin >> s;
		insert(s);
	}
	string q;
	cin >> q;
	cout << quick(q);
	
	return 0;
}