字符串匹配，暴力可過(guò)
#include <cstring>#include <cstdio>char dic[10010][17];int wlen[10010];char Word[17];int dcnt;bool change(int index){ int len = strlen(word); int cnt = 0; for(int i = 0; i < len; ++i) { if(word[i] != dic[index][i]) ++cnt; if(cnt > 1) return false; } return true;}bool del(int index){ int len = strlen(word); int cnt,m; for(int i = 0; i < len; ++i) { cnt = m = 0; for(int j = 0; j < len; ++j) { if(j == i) continue; if(word[j] != dic[index][m++]) ++cnt; if(cnt) break; } if(!cnt) return true; } return false;}bool add(int index){ int len = strlen(dic[index]); int cnt,m; for(int i = 0; i < len; ++i) { cnt = m = 0; for(int j = 0; j < len; ++j) { if(i == j) continue; if(dic[index][j] != word[m++]) ++cnt; if(cnt) break; } if(!cnt) return true; } return false;}void check(){ int len = strlen(word); for(int i = 0; i < dcnt; ++i) if(len == wlen[i]) if(strcmp(dic[i],word) == 0) {新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
