【数据结构】了解哈希表，解决哈希冲突，用Java模拟实现哈希桶

import java.util.LinkedList;

public class HashTable<K, V> {
    // 哈希桶的数组大小
    private static final int BUCKET_SIZE = 16;

    // 哈希桶数组
    private LinkedList<Pair<K, V>>[] buckets;

    // 构造函数，初始化哈希桶数组
    public HashTable() {
        buckets = new LinkedList[BUCKET_SIZE];
        for (int i = 0; i < BUCKET_SIZE; i++) {
            buckets[i] = new LinkedList<>();
        }
    }

    // 插入键值对
    public void put(K key, V value) {
        int bucketIndex = calculateBucketIndex(key);
        buckets[bucketIndex].add(new Pair<>(key, value));
    }

    // 获取键对应的值
    public V get(K key) {
        int bucketIndex = calculateBucketIndex(key);
        for (Pair<K, V> pair : buckets[bucketIndex]) {
            if (pair.getKey().equals(key)) {
                return pair.getValue();
            }
        }
        return null; // 未找到键，返回null
    }

    // 计算哈希桶索引
    private int calculateBucketIndex(K key) {
        // 简化的哈希函数
        int hash = key.hashCode();
        return hash % BUCKET_SIZE;
    }

    // 辅助类，用来存储键值对
    private static class Pair<K, V> {
        private K key;
        private V value;

        public Pair(K key, V value) {
            this.key = key;
            this.value = value;
        }

        public K getKey() {
            return key;
        }

        public V getValue() {
            return value;
        }
    }
}