算法-----链接法散列表

package com.eshore.sweetop.dataframe;

import java.util.LinkedList;

import com.eshore.sweetop.data.KeyData;

public class ChainedHash {

LinkedList<KeyData>[] table = new LinkedList[10];

public void insert(KeyData o){

if(table[hash(o.getKey())]==null)

table[hash(o.getKey())]=new LinkedList<KeyData>();

table[hash(o.getKey())].add(o);

}

public void delete(KeyData o) {

table[hash(o.getKey())].remove(o);

}

public KeyData search(int k) {

for (KeyData kd : table[hash(k)]) {

if(kd.getKey()==k){

return kd;

}

}

return null;

}

public int hash(int k) {

return k % 10;

}

public static void main(String[] args) {

ChainedHash ch=new ChainedHash();

ch.insert(new KeyData(2));

ch.insert(new KeyData(3));

ch.insert(new KeyData(13));

ch.insert(new KeyData(4));

ch.delete(new KeyData(3));

System.out.println(ch.search(3));

}

}