Java数据结构学习笔记-哈希表

public class hashTest {
    public static void main(String args[]) {
        HashTab hashTab = new HashTab(7);
        Scanner scan=new Scanner(System.in);
        while (true){
            System.out.println("1:添加");
            System.out.println("2:删除");
            System.out.println("3:遍历");
            System.out.println("4:寻找");
            System.out.println("5:退出");
            System.out.print("请输入选择:");
            boolean isFlag=false;
            String str=scan.next();
            switch (str){
                case "1":
                    System.out.print("姓名:");
                    String name=scan.next();
                    System.out.print("id:");
                    int id=scan.nextInt();
                    Emp emp=new Emp(id,name);
                    hashTab.add(emp);
                    break;
                case "2":
                    System.out.println("id:");
                    int id2=scan.nextInt();
                    hashTab.del(id2);
                    break;
                case "3":
                    hashTab.list();
                    break;
                case "4":
                    System.out.println("id:");
                    int id1=scan.nextInt();
                    hashTab.find(id1);
                    break;
                case "5":
                    System.out.println("确定(Y) 取消(N):");
                    String str2=scan.next();
                    if (str2.equals("Y")||str2.equals("y")){
                        isFlag=true;
                    }
                    break;
            }
            if (isFlag){
                break;
            }
        }
    }


}
class Emp {
    private int id;
    private String name;
    public Emp next;

    public Emp(int id, String name) {
        this.id = id;
        this.name = name;
    }

    public int getId() {
        return id;
    }

    public void setId(int id) {
        this.id = id;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    @Override
    public String toString() {
        return "Emp{" +
                "id=" + id +
                ", name='" + name + '\'' +
                '}';
    }


}
    class EmpLinkedList{


    private Emp head;

    public EmpLinkedList() {

    }

    public Emp getHead() {
        return head;
    }

    public void setHead(Emp head) {
        this.head = head;
    }

    public void add(Emp emp){
        if (head==null){
            head=emp;
            return;
        }
        Emp temp=head;

        while (true){
            if (temp.next==null){
                break;
            }
            temp=temp.next;
        }
        temp.next=emp;
    }

    public void del(int id){
        if (head==null){
            System.out.println("链表为空,无法删除");
            return;
        }
        Emp temp=head;
        if (temp.getId()==id){
            head=head.next;
            System.out.println("删除成功");
            return;
        }
        boolean isflag=false;
        while (true){
            if (temp.next.getId()==id){
                isflag=true;
                break;
            }
            if(temp.next==null){
                break;
            }
            temp=temp.next;
        }
        if (isflag){
            temp.next=temp.next.next;
            System.out.println("删除成功");
        }else {
            System.out.println("删除失败");

        }

    }

    public void find(int id){
        if (head==null){
            System.out.println("链表为空");
            return;
        }
        Emp temp=head;
        boolean isflag=false;
        while (true){
            if (temp.getId()==id){
                isflag=true;
                break;
            }
            if(temp.next==null){
                break;
            }
            temp=temp.next;
        }
        if (isflag){
            System.out.println(temp);
        }else {
            System.out.println("没有这个员工");

        }
    }

    public void list(){
        if (head==null){
            System.out.println("链表为空,无法遍历");
            return;
        }
        Emp temp=head;
        while (true){
            System.out.print(temp+"\t");
            if (temp.next==null){
                break;
            }
            temp=temp.next;
        }
    }




}
    class HashTab{
        int maxSize;

        EmpLinkedList[]  listArry;
        public HashTab(int maxSize) {
            this.maxSize=maxSize;
            listArry=new EmpLinkedList[maxSize];
            for (int i=0;i<maxSize;i++){
                listArry[i]=new EmpLinkedList();
            }
        }

        public int hash(int id){
            int hashCode=id%10;
            return hashCode;
        }

        public void add(Emp emp) {
            int hashCode = hash(emp.getId());
            EmpLinkedList list = listArry[hashCode];
            list.add(emp);
        }

        public void del(int id){
            int hashCode=hash(id);
            EmpLinkedList list=listArry[hashCode];
            list.del(id);
        }

        public void list(){
            for (int i=0;i<maxSize;i++){
                listArry[i].list();
                System.out.println();
            }
        }

        public  void find(int id){
            int hashCode=hash(id);
            EmpLinkedList list=listArry[hashCode];
            list.find(id);
        }
    }

共勉!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值