1. 什么是哈希表
- 散列表(Hash table,也叫哈希表),是根据关键码值(Key value)而直接进行访问的数据结构。也就是说,它通过把关键码值映射到表中一个位置来访问记录,以加快查找的速度。这个映射函数叫做散列函数,存放记录的数组叫做散列表。
- 给定表M,存在函数f(key),对任意给定的关键字值key,代入函数后若能得到包含该关键字的记录在表中的地址,则称表M为哈希(Hash)表,函数f(key)为哈希(Hash) 函数。
代码实现
package com.qin.hashtable;
import java.util.Scanner;
public class HashTableDemo {
public static void main(String[] args) {
HashTab hashTab = new HashTab(7);
Scanner scanner = new Scanner(System.in);
String key = " ";
boolean loop = true;
while (loop){
System.out.println("add 添加一个雇员");
System.out.println("list 遍历所有雇员");
System.out.println("exit 结束观察");
System.out.println("find 查找雇员");
System.out.println("del 根据id删除雇员");
key = scanner.next();
switch (key){
case "add":
System.out.println("输入id");
int id = scanner.nextInt();
System.out.println("输入名字");
String name =scanner.next();
Emp emp = new Emp(id, name);
hashTab.add(emp);
break;
case "list":
hashTab.list();
break;
case "find":
System.out.println("请输入要查找的id");
id = scanner.nextInt();
hashTab.findEmpById(id);
break;
case "del":
System.out.println("请输入要删除的id");
id = scanner.nextInt();
hashTab.deleteEmpById(id);
break;
case "exit":
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("gg");
}
}
class Emp{
public int id;
public String name;
public Emp next;
public Emp(int id, String name) {
this.id = id;
this.name = name;
}
}
class EmpLinkedList{
private Emp head;
public void add(Emp emp){
if (head==null){
head = emp;
return;
}
Emp cur = head;
while (true){
if (cur.next==null){
break;
}
cur =cur.next;
}
cur.next = emp;
}
public void list(int no){
if (head == null){
System.out.println("第"+(no+1)+"链表为空");
return;
}
System.out.printf("第%d链表的信息为",no+1);
Emp cur = head;
while (true){
System.out.printf("=> id=%d name = %s \t",cur.id,cur.name);
if (cur.next==null){
break;
}
cur = cur.next;
}
System.out.println();
}
public Emp findEmpById(int id){
if (head==null){
System.out.println("链表为空");
return null;
}
Emp cur = head;
while (true){
if (cur.id==id){
break;
}
if (cur.next==null){
cur = null;
break;
}
cur = cur.next;
}
return cur;
}
public void deleteEmpById(int id){
Emp cur = head;
if (head==null){
System.out.println("链表为空,无法删除");
return;
}
while (true){
if (head.id == id){
head = head.next;
return;
}
if (cur.next==null){
break;
}
if (cur.next.id==id){
cur.next = cur.next.next;
return;
}else {
System.out.println("找不到要删除的id");
}
cur = cur.next;
}
}
}
class HashTab{
private EmpLinkedList[] empLinkedListArray;
private int size;
public HashTab(int size) {
this.size =size;
empLinkedListArray = new EmpLinkedList[size];
for (int i = 0; i < size ; i++) {
empLinkedListArray[i] = new EmpLinkedList();
}
}
public void add(Emp emp){
int empLinkedListNo = hashFun(emp.id);
empLinkedListArray[empLinkedListNo].add(emp);
}
public int hashFun(int id){
return id % size;
}
public void list(){
for (int i = 0; i < size; i++) {
empLinkedListArray[i].list(i);
}
}
public void findEmpById(int id){
int empLinkedListNo = hashFun(id);
Emp emp = empLinkedListArray[empLinkedListNo].findEmpById(id);
if (emp==null){
System.out.println("没有这个雇员");
}else {
System.out.println("在第"+(empLinkedListNo+1)+"找到了该雇员,雇员id="+emp.id+",名字name="+emp.name);
}
}
public void deleteEmpById(int id){
int empLinkedListNo = hashFun(id);
empLinkedListArray[empLinkedListNo].deleteEmpById(id);
System.out.println("删除成功");
}
}
- 结果