《算法基础》 哈希算法
1.哈希表–拉链法
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 100003;
int h[N], e[N], ne[N], idx;
int n;
void insert(int x)
{
int k = (x % N + N) % N;
e[idx] = x;
ne[idx] = h[k];
h[k] = idx ++;
}
bool query(int x)
{
int k = (x % N + N) % N;
for (int i = h[k]; i != -1; i = ne[i]) {
if (e[i] == x) return true;
}
return false;
}
int main()
{
cin >> n;
char op[2];
int x;
memset(h, -1, N * sizeof(int));
while (n --) {
scanf("%s%d", op, &x);
if (*op == 'I') {
insert(x);
} else {
if (query(x)) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
return 0;
}
2.哈希表–开放寻址发
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 300007, null = 0x3f3f3f3f;
int h[N];
int n;
int find(int x)
{
int k = (x % N + N) % N;
while (h[k] != null && h[k] != x) {
k ++;
if (k == N) k = 0;
}
return k;
}
int main()
{
cin >> n;
char op[2];
int x;
memset(h, 0x3f, N * sizeof(int));
while (n --) {
scanf("%s%d", op, &x);
int k = find(x);
if (*op == 'I') {
h[k] = x;
} else {
if (h[k] != null) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
return 0;
}
3.哈希字符串
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef unsigned long long ULL;
const int N = 100010, P = 131;
int n, m;
char str[N];
ULL h[N], p[N];
ULL get(int l, int r)
{
return h[r] - h[l - 1] * p[r - l + 1];
}
int main()
{
cin >> n >> m >> str + 1;
p[0] = 1;
for (int i = 1; i <= n; i ++) {
h[i] = h[i - 1] * P + str[i];
p[i] = p[i - 1] * P;
}
int l1, r1, l2, r2;
while (m --) {
scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
if (get(l1, r1) == get(l2, r2)) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}