2013年4月20日
hdoj 1298 T9 字典树 宽度优先BFS
摘要： #include<stdio.h>#include<malloc.h>#include<string.h>struct node { int pn; struct node *next[26];};char a[10][5]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};char num[10 阅读全文
posted @ 2013-04-20 15:15 煮人为乐 阅读(266) 评论(0) 推荐(0) 编辑