Java实现哈希表（数组+链表）

短命女 2023-07-14 03:20 3阅读 0赞

[*点击进入尚硅谷数据结构和算法Java代码导航*][Java]

public class HashDemo {
        
    
    	public static void main(String[] args) {
        
    		// TODO Auto-generated method stub
    
    		HashTab ht = new HashTab(7);
    		ht.add(6, "zhangsan");
    		ht.add(3, "lisi");
    		ht.add(1, "ww");
    		ht.add(4, "wangwu");
    		ht.add(10, "SDSF");
    //		ht.print();
    		ht.findById(10);
    	}
    
    }
    
    class employee{
        
    	int id;
    	String name;
    	employee next = null;
    	public employee(int id, String name) {
        
    		super();
    		this.id = id;
    		this.name = name;
    	}
    	
    }
    
    class employeeList{
        
    	employee head;
    	
    	//按id从小到大插入雇员
    	public void add(int id, String name) {
        
    		//空链表直接插入
    		if(head == null) {
        
    			head = new employee(id, name);
    		}else {
        
    			employee temp = head;
    			employee emp = new employee(id, name);
    			//位于链表最前方
    			if(id < temp.id) {
        
    				head = emp;
    				head.next = temp;
    			}else {
        
    				//找到合适的位置
    				while(temp.next != null && temp.next.id < id) {
        
    					temp = temp.next;
    				}
    				emp.next = temp.next;
    				temp.next = emp;
    			}
    		}
    	}
    	//输出链表
    	public void print() {
        
    		employee temp = head;
    		while(temp != null) {
        
    			System.out.printf("   id=%d, name=%s -->",temp.id, temp.name);
    			temp = temp.next;
    		}
    	}
    }
    
    class HashTab{
        
    	int size;
    	private employeeList[] employeeListArr;
    	public HashTab(int size) {
        
    		this.size = size;
    		employeeListArr = new employeeList[size];
    		for(int i=0; i<size; i++) {
        
    			employeeListArr[i] = new employeeList();
    		}
    	}
    	
    	public void add(int id, String name) {
        
    		int no = id % size;
    		employeeListArr[no].add(id, name);
    	}
    	
    	public void findById(int id) {
        
    		int no = id % size;
    		employee temp = employeeListArr[no].head;
    		while(temp != null) {
        
    			if(temp.id == id) {
        
    				System.out.printf("employee on the %d link.", no);
    				return ;
    			}
    			temp = temp.next;
    		}
    		System.out.printf("id:%d is not exist.", id);
    	}
    	public void print() {
        
    		for(int i=0; i<size; i++) {
        
    			System.out.printf("number:%d", i);
    			employeeListArr[i].print();
    			System.out.println();
    		}
    	}
    }

[Java]: https://blog.csdn.net/weixin_44963741/article/details/105228982