HHH_go_的博客

字符串hash模板题 字符串hash模板int get_hash(char *s) { int seed=131;//可以用其他代替 int hash=0; for(int i=0;s[i]!='\0';i++) { hash=hash*seed+(s[i]-'a'); } return (hash & 0x7FFFFFFF)%mod

题意：找出由两个字符串拼起来的字符串输出 暴力搜索切点分开字符串，查找有没有两断都存在的 通过字符串hash散列 AC代码#include<stdio.h> #include<string.h> char a[120500][20]; int head[120500]; int next1[120500]; int get_hash(char *s) { int hash=0;

之前用hash做过这题后面想一下其实字典树也是一样的 只要把hash的建立过程替换成建立字典树就可以了速度上更快一点 不过空间消耗大。 hash链接->hash AC代码字典树AC代码#include<stdio.h> #include<string.h> struct Trie { struct node { int flag; int nex

Period HDU - 1358 For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to

Seek the Name, Seek the Fame POJ - 2752 The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They see