数据结构训练Babelfishhash.docVIP

数据结构训练 Babelfish hash（ELFhash） 转发 评论 6分钟前 Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them. Input Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters. Output Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as eh. Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output cat eh loops Hint Huge input and output,scanf and printf are recommended 题意：给一个单词和他的翻译。然后再给些单词，找到对应的翻译。若找不到就输出eh 分析：利用了hash函数（ELFhash） 详解ELFhash: 算法： 1.把字符窜的每个字符依次相加，每次将加的结果向左移动4位。 2.如果加的结果大于28位，对结果向右移动24位与原值取异或。 // ELF Hash Functionunsigned int ELFHash(char *str){ unsigned int hash = 0; unsigned int x = 0; while (*str) { hash = (hash 4) + (*str++); // hash左移4位，当前字符ASCII存入hash低四位。 /** * 如果最高的四位不为0，则说明字符多余7个，如果不处理，再加第九个字符时，第一个字符 * 会被移出，因此要有如下处理。该处理，如果对于字符串(a-z 或者A-Z)就会仅仅影响5-8 * 位，否则会影响5-31位，因为C语言使用的算数移位。 */ if ((x = hash 0xF0000000L) != 0) { hash ^= (x 24); hash = ~x; //清空28-31位。 } } #include iostream#include stdio.h#include string.h#define M 150000using namespace std;//定义结构体typedef struct{ char a[12]; char b[12]; int next;}Elem;//结构体数组Elem elem[M];//hash数组int hashindex[M];//ELFhash 函数int ELFhash(char *key){ unsigned long h=0; while(*key) { //每次取出单词的前一个字母加到h里面 h=(h4)+(*key++); //如果h大于了28位则g左移24位与原值去异或 unsigned long g=h0xf0000000L; if(g) h^=g24; //清空28-31位。 h=~g;  } //返回hash值 return h%M;}void find(char