算法-----开放寻址法

1. packagecom.eshore.sweetop.dataframe;
3. importcom.eshore.sweetop.data.KeyData;
6. /*
7. *开放寻址法解决碰撞问题
8. */
9. publicclassOpenHash{
10. protectedKeyData[]table;
11. publicOpenHash(intsize){
12. table=newKeyData[size];
13. }
15. publicvoidinsert(KeyDatakd){
16. intj=0,k=kd.getKey();
17. for(inti=0;i<table.length;i++){
18. j=hash(k,i);
19. if(table[j]==null){
20. table[j]=kd;
21. return;
22. }
23. }
24. thrownewRuntimeException("hashtableoverflow!");
25. }
27. publicKeyDatasearch(intk){
28. intj=0;
29. for(inti=0;i<table.length;i++){
30. j=hash(k,i);
31. if(table[j].getKey()==k){
32. returntable[j];
33. }
34. }
35. returnnull;
36. }
39. /*
40. *当然不能这么写，这里重点是开放寻址法，关于探查序列，后面有续
41. */
42. publicinthash(intk,inti){
43. returni;
44. }
46. publicstaticvoidmain(String[]args){
47. OpenHashoh=newOpenHash(10);
48. oh.insert(newKeyData(1));
49. oh.insert(newKeyData(2));
50. oh.insert(newKeyData(3));
51. oh.insert(newKeyData(14));
52. KeyDatak=oh.search(2);
53. System.out.println(k);
54. }
55. }