【Java数据结构】哈希表详解

===================

开散列法又叫链地址法(开链法)，首先对关键码集合用散列函数计算散列地址，具有相同地址的关键码归于同一子 集合，每一个子集合称为一个桶，各个桶中的元素通过一个单链表链接起来，各链表的头结点存储在哈希表中。

static class Node {

public int key;

public int val;

public Node next;

public Node(int key, int val) {

this.key = key;

this.val = val;

}

}

private Node[] array;

public int usedSize;

public HashBucket() {

this.array = new Node[10];

this.usedSize = 0;

}

public void put(int key,int val){

int index = key % this.array.length;

Node cur = array[index];

while (cur != null){

if(cur.val == key){

cur.val = val;

return;

}

cur = cur.next;

}

//头插法

Node node = new Node(key,val);

node.next = array[index];

array[index] = node;

this.usedSize++;

if(loadFactor() >= 0.75){

resize();

}

}

public int get(int key) {

//以什么方式存储的 那就以什么方式取

int index = key % this.array.length;

Node cur = array[index];

while (cur != null) {

if(cur.key == key) {

return cur.val;

}

cur = cur.next;

}

return -1;//

}

public void resize(){

Node[] newArray = new Node[2*this.array.length];

for (int i = 0; i < this.array.length; i++){

Node cur = array[i];

Node curNext = null;

while (cur != null){

curNext = cur.next;

int index = cur.key % newArray.length;

cur.next = newArray[i];

newArray[i] = cur;

cur = curNext.next;

cur = curNext;

}

}

this.array = newArray;

}

6，完整代码

==========

class HashBucket {

static class Node {

public int key;

public int val;

public Node next;

public Node(int key, int val) {

this.key = key;

this.val = val;

}

}

private Node[] array;

public int usedSize;

public HashBucket() {

this.array = new Node[10];

this.usedSize = 0;

}

public void put(int key,int val) {

//1、确定下标

int index = key % this.array.length;

//2、遍历这个下标的链表

Node cur = array[index];

while (cur != null) {

//更新val

if(cur.key == key) {

cur.val = val;

return;

}

cur = cur.next;

}

//3、cur == null 当前数组下标的 链表 没要key

Node node = new Node(key,val);

node.next = array[index];

array[index] = node;

this.usedSize++;

//4、判断 当前 有没有超过负载因子

if(loadFactor() >= 0.75) {

//扩容

resize();

}

}

public int get(int key) {

//以什么方式存储的 那就以什么方式取

int index = key % this.array.length;

Node cur = array[index];

while (cur != null) {

if(cur.key == key) {

return cur.val;

}

cur = cur.next;

}

return -1;//

}

public double loadFactor() {

return this.usedSize*1.0 / this.array.length;

}

public void resize(){

Node[] newArray = new Node[2*this.array.length];

for (int i = 0; i < this.array.length; i++){

Node cur = array[i];

Node curNext = null;