整数及字符串哈希

来源:互联网 发布:岭回归 数据标准化 编辑:程序博客网 时间:2024/06/05 23:42

Hash

此处哈希指直接映射,以空间换时间,提供几乎O( 1 )的查询速度。

PS: hash数组用前,请memset(hash,-1,sizeof(hash));

1:整数哈希,数字可重复

const int maxn = 0xff;int hash[maxn], count[maxn]; int hashit(int k){    int t = k % maxn;    if( t < 0 )t += maxn;    while( hash[t] != -1 && hash[t] != k )t = (t + 1) % maxn;    if( hash[t] == -1 )hash[t] = k, count[t] = 1;else ++count[t];}


2:字符串哈希(一般可用字典树代替)

const int maxn = 0xff;int hash[maxn], count[maxn];void init(){    memset(hash,-1,sizeof(hash));    memset(count,-1,sizeof(count));}inline unsigned int BKDRHash(char *str){unsigned int seed = 131; // 31 131 1313 13131 131313 etc..unsigned int hash = 0;while (*str){hash = hash * seed + (*str++);}return (hash & 0x7FFFFFFF);}inline void hashit(char *str){    int k,t;    while( *str == '0' )    str++;  ///这里有时候不需要去零    k = BKDRHash(str);    t = k % maxn;    while( hash[t] != k && hash[t] != -1 )t = ( t + 10 ) % maxn;    if( hash[t] == -1 ) hash[t] = k, count[t] = 1;    else ++count[t];}

3:常用的字符串哈希函数

// RS Hash Functionunsigned int RSHash(char* str){    unsigned int b = 378551 ;    unsigned int a = 63689 ;    unsigned int hash = 0 ;    while (*str)    {        hash = hash * a + (*str ++ );        a *= b;    }    return (hash & 0x7FFFFFFF );}// JS Hash Functionunsigned int JSHash(char* str){    unsigned int hash = 1315423911 ;    while (*str)    {        hash ^= ((hash << 5 ) + (*str ++ ) + (hash >> 2 ));    }    return (hash & 0x7FFFFFFF );}// P. J. Weinberger Hash Functionunsigned int PJWHash(char* str){    unsigned int BitsInUnignedInt = (unsigned int )( sizeof (unsigned int)*8 );    unsigned int ThreeQuarters = (unsigned int )((BitsInUnignedInt*3 ) / 4 );    unsigned int OneEighth = (unsigned int )(BitsInUnignedInt / 8 );    unsigned int HighBits = (unsigned int )( 0xFFFFFFFF ) << (BitsInUnignedInt - OneEighth);    unsigned int hash = 0 ;    unsigned int test = 0 ;    while (*str)    {        hash = (hash << OneEighth) + (*str ++ );        if ((test = hash & HighBits) != 0 ) {            hash = ((hash ^ (test >> ThreeQuarters)) & ( ~ HighBits));        }    }    return (hash & 0x7FFFFFFF );}// ELF Hash Functionunsigned int ELFHash(char* str){    unsigned int hash = 0 ;    unsigned int x = 0 ;    while (*str)    {        hash = (hash << 4 ) + (*str ++ );        if ((x = hash & 0xF0000000L ) != 0 ) {            hash ^= (x >> 24 );            hash &= ~ x;        }    }    return (hash & 0x7FFFFFFF );}// BKDR Hash Functionunsigned int BKDRHash(char* str){    unsigned int seed = 131 ; // 31 131 1313 13131 131313 etc..    unsigned int hash = 0 ;    while (*str)    {        hash = hash*seed + (*str ++ );    }    return (hash & 0x7FFFFFFF );}// SDBM Hash Functionunsigned int SDBMHash(char* str){    unsigned int hash = 0 ;    while (*str)    {        hash = (*str ++ ) + (hash << 6 ) + (hash << 16 ) - hash;    }    return (hash & 0x7FFFFFFF );}// DJB Hash Functionunsigned int DJBHash(char* str){    unsigned int hash = 5381 ;    while (*str)    {        hash += (hash << 5 ) + (*str ++ );    }    return (hash & 0x7FFFFFFF );}// AP Hash Functionunsigned int APHash(char* str){    unsigned int hash = 0 ;    int i;    for (i = 0 ;*str; i ++ )    {        if ((i & 1 ) == 0 )    {            hash ^= ((hash << 7 ) ^ (*str ++ ) ^ (hash >> 3 ));        }    else {            hash ^= ( ~ ((hash << 11 ) ^ (*str ++ ) ^ (hash >> 5 )));        }    }    return (hash & 0x7FFFFFFF );}

	
				
		
原创粉丝点击