摘要: 参照刘汝佳的trie树 结构体#include "stdio.h"#include "stdlib.h"#include "string.h"#include "malloc.h"/***** 连接字符串和字符 **/char* strcatch(char *str, char ch) { char *p = str; while (*p!='\0') { p++; } *p = ch; *(p+1) = '\0'; return str;}//最大节点数 小于最大单词长度*单词数 阅读全文
posted @ 2014-01-10 12:14 23lalala 阅读(895) 评论(0) 推荐(0) 编辑