字谜游戏(a)C语言

现在的位置: 首页 > 综合 > 正文

RSS

字谜游戏(a)C语言

2013年10月01日 ⁄ 综合 ⁄ 共 6908字 ⁄ 字号小中大 ⁄ 评论关闭

下班到家,吃了口咸菜,之后看了会书,就去睡觉了,因为太困了.(T T...真辛苦.哈哈)

0:40几分醒来了,起来写代码了..

写了个大概,一道习题的一部分,今天完成了,只不过还不够详细,今天下班回来给完善下.无奈啊,我要每天都写出点东西才安心,所以,这个不成熟的作品,也要贴出来.不过没关系,到今天晚上或者明天凌晨,我就改好了,呵呵.

这个的话,眼前通过了几个词汇量词典的测试.下班回来,重新定义一下表,完善下ADT,再模块化下,这样就放心了.

不多说,贴代码.

/* 5-13(a)-10-28-01.36.c -- 第五章第十三题 */ #include <stdio.h> #include <stdlib.h> #define EMPTY 1 #define LEGITIMATE 2 #define ROW 4 #define COLS 4 #define NUL '/0' #define CONSTANT 5 #define SIZE 307 /* 数据类型定义 */ typedef struct cell { int mode ; } Cell ; typedef struct hashtable { int size ; Cell * cell ; } * HashTable ; /* ADT声明 */ long int Hash (const char * word, const int size) ; int InitializeTable (HashTable * const ph, const int size) ; int Find (const HashTable * const ph, const char * word) ; int Insert (const HashTable * const ph, const char * word) ; void Release (const HashTable * const ph) ; /* 局部函数声明 */ int main (void) ; int main (void) { HashTable h ; FILE * fp ; char riddle[ROW][COLS] = { "this", "wats", "oahg", "fgdt" } ; char word[ROW * COLS] ; int size = SIZE, lenth = ROW * COLS ; int i, j, i_max, j_max, i_temp, j_temp, w ; // 将一个词典读入表中 InitializeTable (&h, size) ; fp = fopen ("word.txt", "r") ; while (fgets (word, lenth, fp) != NULL) if (0 == Insert (&h, word)) fputs ("Insert failed", stdout) ; fclose (fp) ; // 开始测试 for (i = 0, i_max = ROW; i < i_max; i++) { for (j = 0, j_max = COLS; j < j_max; j++) { // 左 for (j_temp = j, w = 0; j_temp >= 0; j_temp--, w++) { word[w] = riddle[i][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 右 for (j_temp = j, w = 0; j_temp < j_max; j_temp++, w++) { word[w] = riddle[i][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 上 for (i_temp = i, w = 0; i_temp >= 0; i_temp--, w++) { word[w] = riddle[i_temp][j] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 下 for (i_temp = i, w = 0; i_temp < i_max; i_temp++, w++) { word[w] = riddle[i_temp][j] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 左上 for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp >= 0; i_temp--, j_temp--, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 右上 for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp < j_max; i_temp--, j_temp++, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 左下 for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp >= 0; i_temp++, j_temp--, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } // 右下 for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp < j_max; i_temp++, j_temp++, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; if (Find (&h, word)) printf ("%s/n", word) ; } } } Release (&h) ; return 0 ; } /* ADT定义 */ long int Hash (const char * word, const int size) { long int hash_value = 0 ; while (*word != '/n' && *word != NUL) hash_value = (hash_value << CONSTANT) + *word++ ; return hash_value % size ; } int InitializeTable (HashTable * const ph, const int size) { Cell * temp ; int count ; *ph = (struct hashtable *) malloc (sizeof (struct hashtable)) ; if (NULL == *ph) { puts ("Out of space.") ; return 0 ; } (*ph) -> cell = (Cell *) malloc (sizeof (Cell) * size) ; if (NULL == (*ph) -> cell) { puts ("Out of space.") ; free (*ph) ; return 0 ; } for (count = 0, temp = (*ph) -> cell; count < size; count++) temp[count].mode = EMPTY ; (*ph) -> size = size ; return 1 ; } int Find (const HashTable * const ph, const char * word) { long int hash_value ; int size = (*ph) -> size ; hash_value = Hash (word, size) ; if (LEGITIMATE == (*ph) -> cell[hash_value].mode) return 1 ; return 0 ; } int Insert (const HashTable * const ph, const char * word) { long int hash_value ; int size = (*ph) -> size ; // 不添加换行符 if ('/n' == *word) return 0 ; hash_value = Hash (word, size) ; if (EMPTY == (*ph) -> cell[hash_value].mode) { (*ph) -> cell[hash_value].mode = LEGITIMATE ; return 1 ; } return 0 ; } void Release (const HashTable * const ph) { free ((*ph) -> cell) ; free (*ph) ; }

终于写完了.效率真低得可以了.赶紧贴出来.

/* 5-13(a)-10-28-01.36.c -- 第五章第十三题 */ #include <stdio.h> #include <stdlib.h> #include <string.h> #define ROW 4 #define COLS 4 #define NUL '/0' #define PF '/n' #define CONSTANT 5 #define TABLESIZE 107 /* 数据类型定义 */ typedef struct cell { char * word ; } Cell ; typedef struct hashtable { int size ; Cell * cell ; } * HashTable ; /* ADT声明 */ long int Hash (const char * word, const int size) ; int InitializeTable (HashTable * const ph, const int size) ; Cell * Find (const HashTable * const ph, const char * const word) ; int Insert (const HashTable * const ph, const char * word) ; void Release (const HashTable * const ph) ; int leaner (const int i) ; /* 局部函数声明 */ int main (void) ; char * eat_enter (char * const word) ; void test_and_printf (const HashTable * const ph, const char * const word) ; int main (void) { HashTable h ; FILE * fp ; char riddle[ROW][COLS] = { "this", "wats", "oahg", "fgdt" } ; char word[ROW * COLS] ; int size = TABLESIZE, lenth = ROW * COLS ; int i, j, i_max, j_max, i_temp, j_temp, w ; // 将一个词典读入表中 InitializeTable (&h, size) ; fp = fopen ("word.txt", "r") ; while (fgets (word, lenth, fp) != NULL) { strcpy (word, eat_enter (word)) ; if (0 == Insert (&h, word)) puts ("Insert failed") ; } fclose (fp) ; // 开始测试 for (i = 0, i_max = ROW; i < i_max; i++) { for (j = 0, j_max = COLS; j < j_max; j++) { // 左 for (j_temp = j, w = 0; j_temp >= 0; j_temp--, w++) { word[w] = riddle[i][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 右 for (j_temp = j, w = 0; j_temp < j_max; j_temp++, w++) { word[w] = riddle[i][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 上 for (i_temp = i, w = 0; i_temp >= 0; i_temp--, w++) { word[w] = riddle[i_temp][j] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 下 for (i_temp = i, w = 0; i_temp < i_max; i_temp++, w++) { word[w] = riddle[i_temp][j] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 左上 for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp >= 0; i_temp--, j_temp--, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 右上 for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp < j_max; i_temp--, j_temp++, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 左下 for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp >= 0; i_temp++, j_temp--, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } // 右下 for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp < j_max; i_temp++, j_temp++, w++) { word[w] = riddle[i_temp][j_temp] ; word[w + 1] = NUL ; test_and_printf (&h, word) ; } } } Release (&h) ; return 0 ; } char * eat_enter (char * const word) { int count = 0; while (word[count] != PF) { count++ ; if (NUL == word[count]) return word ; } word[count] = NUL ; return word ; } void test_and_printf (const HashTable * const ph, const char * const word) { Cell * cell ; cell = Find (ph, word) ; if (cell -> word && 0 == strcmp (cell -> word, word)) printf ("%s/n", word) ; } /* ADT定义 */ long int Hash (const char * word, const int size) { long int hash_value = 0 ; while (*word != PF && *word != NUL) hash_value = (hash_value << CONSTANT) + *word++ ; return hash_value % size ; } int InitializeTable (HashTable * const ph, const int size) { int temp ; *ph = (struct hashtable *) malloc (sizeof (struct hashtable)) ; if (NULL == *ph) { puts ("Out of space.[1]") ; return 0 ; } temp = sizeof (Cell) ; (*ph) -> cell = (Cell *) calloc (temp, size) ; if (NULL == (*ph) -> cell) { puts ("Out of space.[2]") ; free (*ph) ; return 0 ; } (*ph) -> size = size ; return 1 ; } Cell * Find (const HashTable * const ph, const char * const word) { long int hash_value ; int size, i, index ; size = (*ph) -> size ; i = 0 ; do { hash_value = Hash (word, size) ; index = (hash_value + leaner (i++)) % size ; } /* 数据域不为空并且字符串不相同 */ while ((*ph) -> cell[index].word != NULL && strcmp (word, (*ph) -> cell[index].word) != 0) ; return (*ph) -> cell + index ; } int Insert (const HashTable * const ph, const char * word) { Cell * cell ; int size = (*ph) -> size ; // 不添加换行符 if ('/n' == *word) return 0 ; cell = Find (ph, word) ; if (NULL == cell -> word) { cell -> word = (char *) malloc (sizeof (char)) ; if (NULL == cell -> word) { puts ("out of space.[4]") ; return 0 ; } strcpy (cell -> word, word) ; return 1 ; } /* 不重复添加 */ return 0 ; } void Release (const HashTable * const ph) { free ((*ph) -> cell) ; free (*ph) ; } int leaner (const int i) { return i ; }

【上篇】测试用例设计白皮书
【下篇】javascript输入匹配

作者: comical

该日志由 comical 于11年前发表在综合分类下，最后更新于 2013年10月01日.
转载请注明: 字谜游戏(a)C语言 | 学步园 +复制链接

抱歉!评论已关闭.

学步园

字谜游戏(a)C语言

作者: comical

书签

最新文章New

本站推荐

返回首页