-
Notifications
You must be signed in to change notification settings - Fork 0
/
pre_search.c
78 lines (64 loc) · 1.2 KB
/
pre_search.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//查找源字符串数组中(已排序),是否包含目的字符串的前缀。头条题库
//大数据量查找应该用二分确定起始字符的位置
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#define MAXLEN 1000
int main(int argc, char **argv){
if(argc != 3)
{
printf("usage!\n");
return -1;
}
int arrlen = atoi(argv[1]);
int retlen = atoi(argv[2]);
int i = 0;
int j = 0;
int k = 0;
int flag = 0;
char arr[arrlen][MAXLEN];
char arrg[retlen][MAXLEN];
int ret[retlen];
while(i < arrlen)
{
scanf("%s", arr[i++]);
}
while(j < retlen)
{
scanf("%s", arrg[j++]);
}
for(i = 0; i < retlen; i++)
{
for(j = 0; j < arrlen; j++)
{
flag = 1;
k = 0;
if(strlen(arr[j]) > strlen(arrg[i]))
{
flag = 0;
continue;
}
while(arr[j][k] != '\0')
{
if(arr[j][k] != arrg[i][k])
{
flag = 0;
break;
}
k++;
}
if(flag == 1)
break;
}
if(flag == 1)
ret[i] = 1;
else
ret[i] = -1;
}
for(i = 0; i < retlen; i++)
{
printf("%d\n", ret[i]);
}
return 0;
}