int main() { int i; nodeptr p; char buf[100]; for (i = 0; i < NHASH; i++) bin[i] = NULL; while (scanf("%s", buf) != EOF) incword(buf); for (i = 0; i < NHASH; i++) for (p = bin[i]; p != NULL; p = p->next) printf("%s %d\n", p->word, p->count); return 0; }
int main(void) { int i; nodeptr p; char* buf = (char *)malloc(sizeof(char) * (WORDLEN + 1)); for(i = 0; i < NHASH; i++) bin[i] = NULL; while(scanf("%s" , buf) != EOF) incword(buf); for(i = 0; i < NHASH; i++) for(p = bin[i]; p != NULL; p = p->next) printf("p->word: %s, p->count: %d\n", p->word, p->count); return 0; }
int main() { int i; Node *p; for (i=0;i<NHASH;i++) bin[i]=NULL; while (getword(buf)>0) incword(buf); for (i=0;i<NHASH;i++) for (p=bin[i];p!=NULL;p=p->next) printf("%d %s\n", p->count, p->word); return 0; }
int main() { freopen("1.txt", "r", stdin); char buf[WORDLENGTH]; int i; while (scanf("%s", buf) != EOF) incword(buf); for (i = 0; i<NHASH; i++) { nodeptr p = hashTable[i]; for (; p; p = p->next) printf("%s %d\n", p->word, p->cnt); } system("pause"); }
int main(void){ for (int i = 0; i < NHASH; i++){ bin[i] = NULL; } char buf[100]; // 假设单词长度小于100字符 while (scanf("%s", buf) != EOF){ incword(buf); } for (int i = 0; i < NHAHS; i++){ for (nodeptr p = bin[i]; p != NULL; p = p->next){ printf("%s %d\n", p->word, p->count); } } return 0; }
void testWordSort2(void) { int i; char buf[50]; nodeptr p; for (i = 0; i < NHASH; i++) bin[i] = NULL; while(gets(buf)) { if ('\n' == buf[0]) { break; } incword(buf); } for (i = 0; i < NHASH; i++) for (p = bin[i]; p != NULL; p = p->next) printf("%s, %d\n", p->word, p->count); }