userluoxuan的专栏

Description Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: 1. Emergency 911

解题思路： 和前面一道

解题思路： 这题和之前的

Description Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possi

定义一颗字典树： struct Trie { int n; // n可以存储相关有用信息，视情况而定 Trie *next[maxn]; //maxn视字典树中有多少种元素而定 } 定义字典树的根并初始化： Trie *root; void init() { root = (Trie *)malloc(sizeof(Trie)); root ->

解题思路： 直接

解题思路： 这题用字典树做可以，用map映射做也可以，当然字典树效率