uva409--String

最新推荐文章于 2020-03-19 16:01:54 发布

iteye_13411

最新推荐文章于 2020-03-19 16:01:54 发布

阅读量140

点赞数

本文介绍了一种简单但高效的代码搜索算法，通过遍历关键字和借口列表，使用暴力搜索方法来匹配输入借口，最终输出匹配度最高的借口集合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

这个比较简单，但是感觉思路很好~

//#define LOCAL #include <stdio.h> #include <string.h> #include <ctype.h> #define MAXN 20 + 10 #define MAX 70 + 10 char keyWords[MAXN][MAX]; char excuses[MAXN][MAX]; int matchedNumber[MAXN]; int bruteForce(); int max(int , int); int nubmerOfKeyWords; int numberOfExcuses; int main() { #ifdef LOCAL freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif int i, j; char c; int cases = 0; while(scanf("%d%d", &nubmerOfKeyWords, &numberOfExcuses) != EOF) { // 数据初始化 memset(matchedNumber, 0, sizeof(matchedNumber)); cases++; // 数据输入 c = getchar(); for(i = 0; i < nubmerOfKeyWords; i++) { gets(keyWords[i]); } for(i = 0; i < numberOfExcuses; i++) { gets(excuses[i]); } // 算法主体 // 暴搜 int maxResult = bruteForce(); // 数据输出 printf("Excuse Set #%d\n", cases); for(i = 0; i < numberOfExcuses; i++) if(matchedNumber[i] == maxResult) { printf("%s\n", excuses[i]); } printf("\n"); } return 0; } int bruteForce() { int i, j, k; int maxResult = 0; int d = 0; char word[MAX]; for(i = 0; i < numberOfExcuses; i++) { for(j = 0; j < strlen(excuses[i]); j++) { if(isalpha(excuses[i][j])) { word[d++] = tolower(excuses[i][j]); } else { word[d] = '\0'; d = 0; for(k = 0; k < nubmerOfKeyWords; k++) { if(strcmp(keyWords[k], word) == 0) matchedNumber[i]++; } } } maxResult = max(matchedNumber[i], maxResult); } return maxResult; } int max(int a, int b) { if(a > b) return a; else return b; }