HashTab基于链表简单实现（java，不包含扩容）

 
/**
 * 表示链表
 */
public class EmpLinkedList {
    //    头指针，指向第一个Emp,默认为null
    private Emp head;
 
    /**
     * 添加雇员
     *
     * @param emp
     */
    public void add(Emp emp) {
        //添加第一个元素
        if (head == null) {
            head = emp;
            return;
        }
        Emp cur = head;
        while (cur.next != null) {
            cur = cur.next;
        }
        cur.next = emp;
    }
 
    /**
     * 输出链表内容
     */
    public void list(int no) {
        if (head == null) {
            System.out.println("当前" + no + "链表为空");
            return;
        }
        System.out.println("当前" + no + "链表的信息为：");
        //辅助指针
        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();
    }
 
    /**
     * 根据id查找雇员
     * @param id
     * @return
     */
    public Emp findEmpById(int id) {
        if (head == null) {
            System.out.println("链表为空");
            return null;
        }
        Emp cur = head;
        while (cur != null) {
            if (cur.id == id) {
                return cur;
            }
            cur = cur.next;
        }
        return null;
    }
    public void del(int id) {
        if (head == null) {
            System.out.println("链表为空");
            return;
        }
        Emp cur = head;
        //删除的位于第一个
        if(head.id==id){
            head=head.next;
            return ;
        }
        while (cur.next != null) {
            if (cur.next.id == id) {
                cur.next=cur.next.next;
                return;
            }
            cur = cur.next;
        }
    }
}

 
public class HashTab {
    private EmpLinkedList[] empLinkedList;
    private int size;
 
    public HashTab(int size) {
        //初始化
        this.size = size;
        empLinkedList = new EmpLinkedList[size];
        for (int i = 0; i < empLinkedList.length; i++) {
            empLinkedList[i] = new EmpLinkedList();
        }
    }
 
    /**
     * 添加雇员
     *
     * @param emp
     */
    public void add(Emp emp) {
        empLinkedList[hashFun(emp.id)].add(emp);
    }
 
    /**
     * 遍历所有链表
     */
    public void list() {
        for (int i = 0; i < size; i++) {
            empLinkedList[i].list(i);
        }
    }
 
    /**
     * 根据ID查找
     * @param id
     * @return
     */
    public Emp findEmpById(int id) {
        return empLinkedList[hashFun(id)].findEmpById(id);
    }
 
    /**
     * 根据ID删除
     * @param id
     */
    public void del(int id) {
        empLinkedList[hashFun(id)].del(id);
    }
 
    /**
     * 散列函数，取模法
     *
     * @param id
     * @return
     */
    public int hashFun(int id) {
        return id % size;
    }
 
}

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);
        boolean loop = true;
        while (loop) {
            System.out.println("add:添加雇员");
            System.out.println("list:显示雇员");
            System.out.println("find:查找雇员");
            System.out.println("del:删除");
            System.out.println("exit:退出系统");
            key = scanner.next();
            int id;
            switch (key) {
                case "add":
                    System.out.println("输入id");
                    id = scanner.nextInt();
                    System.out.println("输入姓名");
                    String name = scanner.next();
                    hashTab.add(new Emp(id, name));
                    break;
                case "find":
                    System.out.println("输入id");
                    id = scanner.nextInt();
                    Emp empById = hashTab.findEmpById(id);
                    System.out.println(empById);
                    break;
                case "del":
                    System.out.println("输入id");
                    id = scanner.nextInt();
                    hashTab.del(id);
                    break;
                case "list":
                    hashTab.list();
                    break;
                case "exit":
                    loop = false;
                    scanner.close();
                    break;
            }
        }
    }
}