简单的哈希模仿,直接模拟就OK。
Run Time: 0sec
Run Memory: 304KB
Code length: 601Bytes
SubmitTime: 2011-12-27 21:01:04
// Problem#: 4699
// Submission#: 1138418
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <cstdio>
using namespace std;
int main()
{
int n, m;
int key;
int i;
int data[ 10000 ];
scanf( "%d%d", &n, &m );
for ( i = 0; i < m; i++ )
data[ i ] = -1;
while ( n-- ) {
scanf( "%d", &key );
i = key % m;
while ( data[ i ] != -1 ) {
i++;
if ( i == m )
i = 0;
}
data[ i ] = key;
}
for ( i = 0; i < m; i++ ) {
printf( "%d#", i );
data[ i ] == -1 ? printf( "NULL\n" ): printf( "%d\n", data[ i ] );
}
return 0;
}
本文详细阐述了如何通过简单的哈希算法实现数据的高效存储与检索,包括输入解析、哈希映射与数据输出的过程。
221

被折叠的 条评论
为什么被折叠?



