算法-----直接寻址表

1. packagecom.eshore.sweetop.dataframe;
4. /*
5. *直接寻址表
6. *假设每个对象的key都是唯一的
7. */
8. publicclassDirectAddress{
9. privatestaticData[]u=newData[100];
11. publicstaticvoidinsert(Datax){
12. u[x.key]=x;
13. }
15. publicstaticDatasearch(intk){
16. returnu[k];
17. }
19. publicstaticvoiddelete(Datax){
20. u[x.key]=null;
21. }
25. publicstaticvoidmain(String[]args){
26. Datad=newData();
27. DirectAddress.insert(d);
28. System.out.println(d.key);
29. Datad2=newData();
30. DirectAddress.insert(d2);
31. System.out.println(d2.key);
32. System.out.println((int)Character.MIN_VALUE);
33. }
34. }
36. classData{
37. privatestaticintd=0;
38. publicintkey=d++;
39. }