HashTable 板子
发布时间:2020-12-15 07:31:40 所属栏目:Java 来源:网络整理
导读:struct HashTable { typedef ull T; typedef int S; static const int N = ( int )1e6 + 7 ; static const int M = ( int )1e5 + 7 ; int head[N],tot; struct Node { T fval; S sval; int nex; } a[M]; void clear() { memset(head, - 1 , sizeof (head));
struct HashTable { typedef ull T; typedef int S; static const int N = (int)1e6 + 7; static const int M = (int)1e5 + 7; int head[N],tot; struct Node { T fval; S sval; int nex; } a[M]; void clear() { memset(head,-1,sizeof(head)); tot = 0; } void insert(T fval,S sval) { int p = fval % N; a[tot].fval = fval; a[tot].sval = sval; a[tot].nex = head[p]; head[p] = tot++; } S find(T fval) { int p = fval % N; for(int i = head[p]; ~i; i = a[i].nex) { if(a[i].fval == fval) return a[i].sval; } return -1; } } Map; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |