//链式哈希表,将数据存在桶中
struct chtbale{
buckets : i32, //桶的个数
size : i32, //数据数量
table : Vec<Option<Vec<i32>>>, //哈希表
}
impl chtbale{
fn hashfunc(&self,data:i32) -> i32{ //哈希函数
return data % self.buckets;
}
fn lookup(&self,data:i32) -> bool{
let bucket :i32 = self.hashfunc(data);
let optionlst = self.table[bucket as usize].as_ref();
if let Some(lists) = optionlst{
if lists.contains(&data){
return true;
}
}
return false;
}
pub fn new(buckets:i32) -> Self{ //初始化桶的数量
let mut tt :Vec<Option<Vec<i32>>> = Ve