#include<stdio.h>
using namespace std;
//问题:输入包含n个整数的数列S以及包含q个不重复整数的数列T
//输出既包含于T也包含于S的整数的个数
int search(int A[], int n, int key)
{
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main()
{
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
{
scanf("%d", &key);
if (search(A, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
int A[1000000], n;
//二分搜索
int binarySearch(int key)
{
int left = 0;
int right = n;
int mid;
while (left < right)
{
mid = (left + right) / 2;
if (key == A[mid]) return 1;//发现key
if (key > A[mid]) left = mid + 1;//搜索后半部分
else if (key < A[mid]) right = mid;//搜索前半部分
}
return 0;
}
散列表(哈希表)
//问题描述:实现一个能执行以下命令的简易“字典”
//insert str:向字典中添加字符串str
//find str:当前字典中包含str时输出yes,不包含时输出no
#include<stdio.h>
#include<string.h>
#define M 1046527
#define NIL (-1)
#define L 14
using namespace std;
char H[M][L];
//将字符转换为数值
int getChar(char ch)
{
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
//将字符串转换为数值并生成key
long long getKey(char str[])
{
long long sum = 0, p = 1, i;
for (i = 0; i < strlen(str); i++)
{
sum += p*(getChar(str[i]));
p *= 5;
}
return sum;
}
int h1(int key) { return key%M; }
int h2(int key) { return 1 + (key % (M - 1)); }
int find(char str[])
{
long long key, i, h;
key = getKey(str);
for (i = 0;; i++)
{
h = (h1(key) + i*h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0) return 0;
}
return 0;
}
int insert(char str[])
{
long long key, i, h;
key = getKey(str);
for (i = 0;; i++)
{
h = (h1(key) + i*h2(key)) % M;
if (strcmp(H[h], str) == 0) return 1;
else if (strlen(H[h]) == 0)
{
strcpy(H[h], str);
return 0;
}
}
return 0;
}
int main()
{
int i, n, h;
char str[L], com[9];
for (i = 0; i < M; i++) H[i][0] = '\0';
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%s %s", com, str);
if (com[0] == 'i')
{
insert(str);
}
else
{
if (find(str))
printf("yes\n");
else
printf("no\n");
}
}
return 0;
}
线性搜索(在线性搜索中,我们可以把含有目标关键字的数据放在数组末尾,用作标记,能有效提高效率)#includeusing namespace std;//问题:输入包含n个整数的数列S以及包含q个不重复整数的数列T//输出既包含于T也包含于S的整数的个数int search(int A[], int n, int key){ int i = 0; A[n] = key; wh