lanshan1111的博客

//一个以链表实现带删除功能允许重复字符串的字典树 #include <stdio.h> #include <string.h> #include <stdlib.h> int charmapping[256]; //字符映射数组,charmapping[i]=x表示ascii码为i的字符对应于treenode中的next[x] void init_cha...

#define MAX 26 const int maxnode=4000*100+100;//预计字典树最大节点数目 const int sigma_size=26;//每个节点的最多儿子数 struct Trie { //这里ch用vector<26元素的数组> ch；实现的话，可以做到动态内存 int ch[maxnode][sigma_size];//ch...

http://poj.org/problem?id=1056 1 判断它是不是其他元素的前缀 2 判断它的前缀有没有 Description An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for ano...

http://acm.hdu.edu.cn/showproblem.php?pid=1251 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).     Input 输入数据的第一部分是一张单...

http://acm.hdu.edu.cn/showproblem.php?pid=1075 Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives hi...

http://poj.org/problem?id=2001 Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1167 Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or ...

https://www.cnblogs.com/luosongchao/p/3239521.html https://blog.csdn.net/v_july_v/article/details/6897097

http://acm.hdu.edu.cn/showproblem.php?pid=4825 Problem Description Zeus 和 Prometheus 做了一个游戏，Prometheus 给 Zeus 一个集合，集合中包含了N个正整数，随后 Prometheus 将向 Zeus 发起M次询问，每次询问中包含一个正整数 S ，之后 Zeus 需要在集合当中找出一个...

http://acm.hdu.edu.cn/showproblem.php?pid=1671 判断是否出现一个字符串的前缀 Problem Description Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of an...

http://acm.hdu.edu.cn/showproblem.php?pid=2846 Problem Description When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give t...

package jjd; import java.util.TreeMap; public class Trie { public class Node { private boolean isWord; private TreeMap<Character, Node> next; public Node(boolean isWord) { this.isW...

http://acm.hdu.edu.cn/showproblem.php?pid=1251   #include <iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> using namespace std; /*****...

Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).     Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空...

度熊手上有一本神奇的字典，你可以在它里面做如下三个操作：    1、insert : 往神奇字典中插入一个单词    2、delete: 在神奇字典中删除所有前缀等于给定字符串的单词    3、search: 查询是否在神奇字典中有一个字符串的前缀等于给定的字符串  Input 这里仅有一组测试数据。第一行输入一个正整数N(1≤N≤100000)N(1≤N≤100000)，代表度熊对于字典的操...