题目
有一个公司,当有新当员工报道,将该员工当信息加入(id,姓名),当输入该员工当id,要求查找该员工当所有信息。
要求
不使用数据库,速度越快越好
提示
哈希表
哈希表
基本介绍
散列表(Hash table,也叫哈希表),是根据关键码值(Key value)而直接进行访问的数据结构。也就是说,它通过把关键码值映射到表中一个位置来访问记录,以加快查找的速度。这个映射函数叫做散列函数,存放记录的数组叫做散列表。
结构
数组+链表
图解
题目图解
代码
import java.util.Scanner;
public class HashTabDemo {
public static void main(String[] args) {
HashTab hashTab = new HashTab(7);
String key = "";
Scanner scanner = new Scanner(System.in);
while (true) {
System.out.println("add: 添加雇员");
System.out.println("list:显示雇员");
System.out.println("find: 查找雇员");
System.out.println("update: 修改雇员");
System.out.println("delete: 删除雇员");
System.out.println("exit:退出系统");
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 "update":
System.out.println("请输入要修改的雇员信息");
id = scanner.nextInt();
hashTab.update(id);
break;
case "delete":
System.out.println("请输入删除雇员id");
id = scanner.nextInt();
hashTab.delete(id);
break;
case "exit":
scanner.close();
System.exit(0);
default:
break;
}
}
}
}
// 创建hashTab
class HashTab {
private EmpLinkedList[] empLinkedLists;
private int size;
public HashTab(int size) {
this.size = size;
empLinkedLists = new EmpLinkedList[size];
for (int i = 0; i < size; i++) {
empLinkedLists[i] = new EmpLinkedList();
}
}
public void add(Emp emp) {
int empLinkedListNO = hashFun(emp.id);
empLinkedLists[empLinkedListNO].add(emp);
}
public void list() {
for (int i = 0; i < size; i++) {
empLinkedLists[i].list(i);
}
}
public void findEmpById(int id){
int empLinkedListNO = hashFun(id);
Emp emp = empLinkedLists[empLinkedListNO].findEmpById(id);
if (emp != null){
System.out.printf("在第%d条找到,雇员id=%d\n",(empLinkedListNO),id);
} else {
System.out.println("没有找到该雇员");
}
}
public void delete(int id){
int empLinkedListNO = hashFun(id);
empLinkedLists[empLinkedListNO].delete(id);
}
public void update(int id){
int empLinkedListNO = hashFun(id);
empLinkedLists[empLinkedListNO].update(id);
}
public int hashFun(int id) {
return id % size;
}
}
class Emp {
public int id;
public String name;
public Emp next;
public Emp(int id, String name) {
super();
this.id = id;
this.name = name;
}
}
class EmpLinkedList {
private Emp head;
// 1.id自增长
public void add(Emp emp) {
if (head == null) {
head = emp;
return;
}
Emp curEmp = head;
while (true) {
if (curEmp.next == null) {
break;
}
curEmp = curEmp.next;
}
curEmp.next = emp;
}
public void list(int no) {
if (head == null) {
System.out.println("第" + no + "条链表为空");
return;
}
System.out.println("第" + no + "条链表信息");
Emp curEmp = head;
while (true) {
System.out.print("=>" + curEmp.id + curEmp.name);
if (curEmp.next == null) {
break;
}
curEmp = curEmp.next;
}
System.out.println();
}
public Emp findEmpById(int id) {
if (head == null) {
System.out.println("null");
return null;
}
Emp curEmp = head;
while (true) {
if (curEmp.id == id) {
break;
}
if (curEmp.next == null){
curEmp = null;
break;
}
curEmp = curEmp.next;
}
return curEmp;
}
public void delete(int id){
if (head == null){
System.out.println("不存在");
return;
}
if (head.id == id){
head = head.next;
return ;
}
Emp curEmp = head;
while (true){
if (curEmp.next == null){
System.out.println("不存在");
break;
}
if (curEmp.next.id == id) {
curEmp.next = curEmp.next.next;
System.out.printf("删除%d成功",id);
break;
}
curEmp = curEmp.next;
}
}
public void update(int id){
Scanner scanner = new Scanner(System.in);
if (head == null){
System.out.println("没找到该雇员信息");
return;
}
Emp curEmp = head;
while (true){
if (curEmp == null){
System.out.println("没找到该雇员信息");
return;
}
if (curEmp.id == id){
System.out.println("请输入要更改的姓名");
String nameChange = scanner.next();
curEmp.name = nameChange;
break;
}
curEmp = curEmp.next;
}
}
}