有关哈希表简单的散列函数实现-Java实现

其实现不难，所以直接贴代码：

package dataSrtuct;

import java.util.ArrayList;
import java.util.LinkedList;

public class HashTab {
    public static void main(String[] args) {
        hashTable hashT=new hashTable(10);
        hashT.addNode(new Emp(12,"Mlq"));
        hashT.addNode(new Emp(13,"Zbb"));
        hashT.addNode(new Emp(14,"Myp"));
        hashT.addNode(new Emp(15,"Mxp"));
        hashT.addNode(new Emp(16,"Mll"));
        hashT.addNode(new Emp(17,"Ylz"));
        Emp node = hashT.findNode(16);
        System.out.println(node.id + node.name);
    }
}
//哈希表
class hashTable{
    private EmpList[] empLists;
    private Integer size;
    
    public hashTable(Integer size) {
        this.empLists = new EmpList[size];
        this.size = size;
        //避免为空
        for (int i = 0; i < empLists.length; i++) {
            empLists[i]=new EmpList();
        }
    }

    /**
     * 简单散列函数
     * @param id 标志
     * @return 散列值
     */
    public Integer hashCode(Integer id){
        return id%size;
    }

    /**
     * 添加节点
     * @param emp 目标节点
     */
    public void addNode(Emp emp){
        Integer hashC=hashCode(emp.id);
        empLists[hashC].addNode(emp);
    }

    /**
     * 查找节点
     * @param id 查找的标志
     * @return 目标节点
     */
    public Emp findNode(Integer id){
        Integer hashC=hashCode(id);
        return empLists[hashC].findNode(id);
    }
}
//对象信息
class Emp{
    public Integer id;
    public String name;
    public Emp next;

    public Emp(Integer id, String name) {
        this.id = id;
        this.name = name;
    }
}
//单个对象链表
class EmpList{
    public Emp head;

    /**
     * 添加哈希表的内部链表节点
     * @param emp 目标添加节点
     * @return 链表节点
     */
    public Emp addNode(Emp emp){
        if (head==null){
            head=emp;
        }
        else {
            Emp curNext=head;
            while (curNext.next!=null){
                curNext=curNext.next;
            }
            curNext.next=emp;
        }
        return head;
    }

    /**
     * 返回查找的哈希表值
     * @param id 查找信息的唯一标志
     * @return 相对应的对象信息
     */
    public Emp findNode(Integer id){
        Emp curNext=head;
        Emp idNext=null;
        while(curNext!=null){
            if (curNext.id.equals(id)){
                idNext=curNext;
                break;
            }
            curNext= curNext.next;
        }
        return idNext;
    }

    /**
     * 删除目标节点
     * @param id 标志
     * @return 删除标志，
     */
    public boolean deleteNode(Integer id){
        Emp idNext=findNode(id);
        idNext.id=idNext.next.id;
        idNext.name=idNext.next.name;
        idNext.next=idNext.next.next;
        if (idNext==null)
            return false;
        else
            return true;
    }

    /**
     * 展示当前链表的信息
     */
    public void listShow(){
        if (head==null)
            System.out.println("此链表为空");
        else {
            Emp curNext=head;
            while (curNext!=null){
                System.out.println("此链表的信息为：");
                System.out.print(curNext.id +":"+ curNext.name+" ");
                curNext=curNext.next;
            }
        }
    }
}