字符串 KMP 与 哈希

牛客字符串习题

link

KMP

kmp模板

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int n, m , k;
string s;
string t;
int ne[N];
void solve() {
	cin >> s >> t;
	n = s.size();
	m = t.size();
	s = " " + s;
	t = " " + t;
	for(int i = 2, j = 0; i <= m; i++) {
		while(j && t[i] != t[j + 1]) j = ne[j];
		if(t[i] == t[j + 1])j++;
		ne[i] = j;
	}

	for(int i = 1, j = 0; i <= n; i++) {
		while(j && s[i] != t[j + 1]) j = ne[j];
		if(s[i] == t[j + 1])j++;
		if(j == m) {
			cout << i - m + 1 << endl;
			j = ne[j];
			//j=i;
		}
	}
	for(int i = 1; i <= m; i++) cout << ne[i] << " \n"[i == m];
}
int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}

每个串在所有串出现次数的乘积
显然找最短串 然后讨论

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 998244353;
const int N = 3e6 + 10;
int n, m , k;
int ne[N];
vector<string>g;
void get_nxt(string t) {
	m = t.size();
	t = " " + t;
	for(int i = 2, j = 0; i <= m; i++) {
		while(j && t[i] != t[j + 1]) j = ne[j];
		if(t[i] == t[j + 1])j++;
		ne[i] = j;
	}
}
int kmp(string s, string t) {
	n = s.size();
	m = t.size();
	t = " " + t;
	s = " " + s;
	int cnt=0;
	for(int i = 1, j = 0; i <= n; i++) {
		while(j && s[i] != t[j + 1]) j = ne[j];
		if(s[i] == t[j + 1])j++;
		if(j == m) {
			cnt++;
			j = ne[j];
			//j=i;
		}
	}
	return cnt;
}
string s;
string t;
string ss;
int ma=1<<30;
void solve() {
	cin >> n;
	fer(i, 1, n) {
		cin >> s;
		g.push_back(s);
		if((int)s.size() < ma) {
			ma = s.size();
			ss = s;
		}
	}
	//cout<<ma<<endl;
	for(auto v : g) {
		if(v.size() == ma && v != ss) {
			fer(i, 1, n) {
				cout << 0 << endl;
			}
            return ;
		}
	}
	int ans = 1;
	get_nxt(ss);
	for(auto v : g)
		ans =ans * kmp(v, ss)%mod;
	for(auto v : g)
		if((int)v.size()^ma)cout << 0 << endl;
		else cout << ans << endl;

}
signed main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}

KMP 灵活运用了属于是
(a[i] + b[i]) % k = (a[i + 1] + b[i + 1]) % k
(a[i + 1] - a[i]) % k = -(b[i + 1] - b[i]) % k
注意全局变量 调了好一会
(m=m-1)

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 3e6 + 10;
int n, m , k;
int ne[N];
int a[N], b[N];
void get_nxt(int t[]) {
	m = m - 1;
	for(int i = 2, j = 0; i <= m; i++) {
		while(j && t[i] != t[j + 1]) j = ne[j];
		if(t[i] == t[j + 1])j++;
		ne[i] = j;
	}
}
int kmp(int s[], int  t[]) {
	int cnt = 0;
	n = n - 1;
	
	for(int i = 1, j = 0; i <= n; i++) {
		while(j && s[i] != t[j + 1]) j = ne[j];
		if(s[i] == t[j + 1])j++;
		if(j == m ) {
			cnt++;
			j = ne[j];
			//j=i;
		}
	}
	return cnt;
}
void solve() {
	cin >> n >> m >> k;
	fer(i, 1, n)a[i] = b[i] = ne[i] = 0;
	fer(i, 1, n)cin >> a[i], a[i] %= k;
	fer(i, 1, m)cin >> b[i], b[i] %= k;
	fer(i, 1, n - 1) a[i] = (a[i + 1] - a[i] + k) % k;
	fer(i, 1, m - 1) b[i] = (b[i] - b[i + 1] + k) % k;
//	fer(i, 1, n - 1)cout << a[i] << " \n"[i == n - 1];
//	fer(i, 1, m - 1)cout << b[i] << " \n"[i == m - 1];
	get_nxt(b);
	cout << kmp(a, b) << endl;

}
int main() {
	IOS;
	int _ ;
	cin >> _;
	while( _-- )
		solve();
}

乘法原理推一下就行

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e7 + 10;
int n, m , k;
string s;
string t;
int ne[N];
vector<int>g;
void solve() {
	cin >> n >> m;
	cin >> s >> t;
	s = " " + s;
	t = " " + t;
	for(int i = 2, j = 0; i <= m; i++) {
		while(j && t[i] != t[j + 1]) j = ne[j];
		if(t[i] == t[j + 1])j++;
		ne[i] = j;
	}

	for(int i = 1, j = 0; i <= n; i++) {
		while(j && s[i] != t[j + 1]) j = ne[j];
		if(s[i] == t[j + 1])j++;
		if(j == m) {
			g.push_back(i - m + 1);
			j = ne[j];
			//j=i;
		}
	}

    int ans = 0;
	int tmp = 0;
	for(auto v : g) {
		ans += (v - tmp) * (n - v - m + 2);
		tmp = v;
	}
	cout << ans << endl;
}
signed main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}

字符串哈希

ull自然取模 容易造成哈希冲突

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int n, m , k;
string s;
ull p[N],h[N];
const int P=131; //13331
vector<int>g;
void init(int n) {
	p[0] = 1;
	fer(i, 1, n) {
		h[i] = h[i - 1] * P + s[i];
		p[i] = p[i - 1] * P;
	}
}
ull get(int l, int r) {
	return h[r] - h[l - 1] * p[r - l + 1];
}
void solve() {
	cin >> n >> m >> s;
	s = " " + s;
	init(n);
	while(m--) {
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		if(get(l1, r1) == get(l2, r2)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}

}
int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}

字符串 双模 质数 哈希

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int n, m , k;
string s;

struct hash_h {
	ll seed, mo;
	ll h[N], p[N];
	void pre() {
		p[0] = 1;
		fer(i, 1, n) {
			h[i] = ( h[i - 1] * seed % mo + s[i] ) % mo;
			p[i] = ( p[i - 1] * seed) % mo ;
		}
	}
	ll get(int l, int r) {
		return (h[r] - h[l - 1] * p[r - l + 1] % mo + mo ) % mo ;
	}
	bool pb(int l1, int r1, int l2, int r2) {
		return  get(l1, r1) == get(l2, r2);
	}
} g[2];
void solve() {
	cin >> n >> m >> s;
	s = " " + s;
	g[0].seed = 131, g[1].seed = 13331;
	g[0].mo = 1e9 + 7, g[1].mo = 1e9 + 9;
	g[0].pre();
	g[1].pre();
	while(m--) {
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		if(g[0].pb(l1, r1, l2, r2 ) && g[1].pb(l1, r1, l2, r2)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}

}
int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值