hdoj 1800 Flying to the Mars (字符串哈希函数)

最新推荐文章于 2018-05-07 11:13:25 发布

原创最新推荐文章于 2018-05-07 11:13:25 发布 · 964 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#fun #less

AC 专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一种使用哈希表解决计算机科学问题的方法，通过线性探测再散列解决冲突，实现了对大量字符串数据的有效存储与检索。文章提供了多种常用的字符串哈希函数，并通过一个具体的编程实例展示了如何实现这一过程。

题目大意：输入N(N<3000)个level (less than 30 digits)，求处于同一level的最多人数。

思路：对每个level(字符串)进行哈希, 存入哈希表,线性探测再散列解决冲突。

附常用字符串哈希函数：

int ELFhash(char *key) { unsigned long h = 0; unsigned long g; while( *key ) { h =( h<< 4) + *key++; g = h & 0xf0000000L; if( g ) h ^= g >> 24; h &= ~g; } return h; } // RS Hash Function unsigned 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 Function unsigned int JSHash( char * str) { unsigned int hash = 1315423911 ; while ( * str) { hash ^= ((hash << 5 ) + ( * str ++ ) + (hash >> 2 )); } return (hash & 0x7FFFFFFF ); } // BKDR Hash Function 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 ); } // SDBM Hash Function unsigned int SDBMHash( char * str) { unsigned int hash = 0 ; while ( * str) { hash = ( * str ++ ) + (hash << 6 ) + (hash << 16 ) - hash; } return (hash & 0x7FFFFFFF ); } // DJB Hash Function unsigned int DJBHash( char * str) { unsigned int hash = 5381 ; while ( * str) { hash += (hash << 5 ) + ( * str ++ ); } return (hash & 0x7FFFFFFF ); } // AP Hash Function unsigned 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 & 0x7FF FFFFF ); }

hdoj 1800 代码：

#include <iostream> using namespace std; const int MAXN=5021; int counter[MAXN],hash[MAXN]; int ans; // strhash int DJBHash( char * str) { int hash = 5381 ; while ( * str) { hash += (hash << 5 ) + ( * str ++ ); } return (hash & 0x7FFFFFFF ); } void hash_fun(char * str) { int k,t; while( *str=='0') * str++; k=DJBHash(str); //k>=0 t=k%MAXN; while(counter[t] && hash[t]!=k) t=(t+1)%MAXN; if(counter[t]) { counter[t]++; if(counter[t]>ans) ans=counter[t]; } else { hash[t]=k; counter[t]=1; } } int main() { char str[50]; int N; while(scanf("%d",&N)!=EOF) { memset(counter,0,sizeof(counter)); ans=1; while(N--) { scanf("%s",&str); hash_fun(str); } printf("%d/n",ans); } return 0; }

http://hi.baidu.com/heiyeshuwu/blog/item/3853baa1ed68b488471064b4.html