51nod 1880 單詞究錯
題目:
給你 n 個字符串當詞典, 還有 m 個字符串當作查詢,每次查詢輸出字典中與當前詢問字符串差一個字符不一樣的字符串(增加,減少,修改)。
分析:
模擬水題,直接暴力枚舉即可。只不過做這個題時 oj 一直報錯,最後才發現有個返回值爲 int 的函數沒有寫返回語句導致 wa。記錄一下。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f;
const int N = 1e2 + 10;
char a[15005][20], b[20];
int na = 0, nb = 0, cnt = 0, flag = 0;
int ans[15005];
int f(int e) {
int sb = strlen(b); int sa = strlen(a[e]);
char* chb = b; char* cha = a[e];
if (abs(sa - sb) > 1) return 0;
int diff = 0;
if (sa == sb) {
for (int i = 0; i < sa; i++) if (chb[i] != cha[i]) diff++;
if (diff == 0) return 1;
else if (diff == 1) ans[cnt++] = e;
return 0;
} else {
if (sa > sb) {
swap(chb, cha); swap(sa, sb);
}
int i = 0, j = 0;
while (i < sa && j < sb) {
if (cha[i] != chb[j]) {
diff++; j++;
} else {
i++; j++;
}
if (diff > 1) break;
}
if (diff <= 1) ans[cnt++] = e;
return 0;
}
}
int main() {
while (1) {
scanf("%s", a[na]);
if (a[na][0] == '#') break; na++;
}
while (1) {
scanf("%s", b);
if (b[0] == '#') break;
cnt = 0; flag = 0;
for (int j = 0; j < na; j++) {
if (f(j) == 1) {
printf("%s is correct\n", b);
flag = 1; break;
}
}
if (flag) continue;
printf("%s:", b);
for (int k = 0; k < cnt; k++) printf(" %s", a[ans[k]]);
printf("\n");
}
return 0;
}