JS实现哈希表(拉链法链表处理冲突)

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>
    <script>
        function LinkedList() {
            this.head = null;
            this.length = 0;

            function Node(data) {
                this.data = data;
                this.next = null;
            }
            LinkedList.prototype.push = function(data) {
                var newNode = new Node(data);
                if (this.length == 0) {
                    this.head = newNode;
                } else {
                    var current = this.head;
                    while (current.next) {
                        current = current.next;
                    }
                    current.next = newNode;
                }
                this.length += 1;
            }

        }

        function HashLinked() {
            this.storage = [];
            this.count = 0;
            this.limit = 7;
            HashLinked.prototype.hashFunc = function(str, size) {
                var hashCode = 0;
                for (var i = 0; i < str.length; i++) {
                    hashCode = hashCode * 37 + str.charCodeAt(i);
                }
                return hashCode % size;
            }
            HashLinked.prototype.put = function(key, value) {
                var index = this.hashFunc(key, this.limit);
                var bucket = this.storage[index];
                if (bucket == null) {
                    bucket = new LinkedList();
                    this.storage[index] = bucket;
                }
                var current = bucket.head;
                while (current) {
                    if (current.data[0] == key) {
                        current.data[1] = value;
                        return;
                    }
                    current = current.next;
                }
                bucket.push([key, value]);
                this.count += 1;
            }
        }
        var h = new HashLinked();
        h.put('abc', 222);
        h.put('cba', 333);
        h.put('nbc', 444);
        h.put('rfd', 456);
        h.put('hte', 648);
        h.put('kuc', 946);
        h.put('yrc', 864);
        console.log(h);
    </script>
</body>

</html>

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值