How to use JS to implement a hash table-JS Tutorial-php.cn

This time I will show you how to use JS to implement a hash table, and what are theprecautions for using JS to implement a hash table. The following is a practical case, let's take a look.

In algorithms, especially in algorithms related to arrays, the use of hash tables can solve problems very well, so this article will record some information about JS implementation of hash tables and give solutions to practical problems. example.

Note:What this article writes is not a real hash table, but is similar to the use of hash tables.

Part 1: Related knowledge points

Enumeration of attributes:

var person = { name: "zzw", sex: "Male", age: 21 }; for (var prop in person) { console.log(prop + " ",person[prop]); }

Copy after login

Output:

#That is, for objects, we can use for in to enumerate the properties of the object.

Deletion of attributes:

var person = { name: "zzw", sex: "Male", age: 21 }; var ifRemove = delete person.name; for (var prop in person) { console.log(prop + " ",person[prop]); } console.log(ifRemove);

Copy after login

The attributes of the object can be deleted through delete, and there will be a return value. As follows:

Note: Generally, only the attributes of the object can be deleted, but the variables cannot be deleted, such as:

var x = 1; console.log(delete x);

Copy after login

At this time, the print station outputs false , because variables cannot be deleted.

Detect whether the attribute exists:

var person = { name: "zzw", sex: "Male", age: 21 }; console.log("age" in person); console.log("someOther" in person);

Copy after login

The former returns true and the latter returns false. That is, we can use in to determine whether an object contains this attribute.

Adding attributes:

var person = { name: "zzw", sex: "Male", age: 21 }; person["school"] = "XJTU"; console.log(person);

Copy after login

The addition of attributes is very simple. As shown above, the final printed object contains the school attribute.

Part 2: Using js to implement a hash table

The following is a hash table obtained through the

constructor, you only need to instantiate it when using it, and the following functions are relatively rich. In actual problems, we can use it selectively.

// 创建构造函数HashTable function HashTable() { // 初始化哈希表的记录条数size var size = 0; // 创建对象用于接受键值对 var res = {}; // 添加关键字，无返回值 this.add = function (key, value) { //判断哈希表中是否存在key，若不存在，则size加1，且赋值 if (!this.containKey(key)) { size++; } // 如果之前不存在，赋值； 如果之前存在，覆盖。 res[key] = value; }; // 删除关键字, 如果哈希表中包含key，并且delete返回true则删除，并使得size减1 this.remove = function (key) { if (this.containKey(key) && (delete res[key])) { size--; } }; // 哈希表中是否包含key，返回一个布尔值 this.containKey = function (key) { return (key in res); }; // 哈希表中是否包含value，返回一个布尔值 this.containValue = function (value) { // 遍历对象中的属性值，判断是否和给定value相等 for (var prop in res) { if (res[prop] === value) { return true; } } return false; }; // 根据键获取value,如果不存在就返回null this.getValue = function (key) { return this.containKey(key) ? res[key] : null; }; // 获取哈希表中的所有value, 返回一个数组 this.getAllValues = function () { var values = []; for (var prop in res) { values.push(res[prop]); } return values; }; // 根据值获取哈希表中的key，如果不存在就返回null this.getKey = function (value) { for (var prop in res) { if (res[prop] === value) { return prop; } } // 遍历结束没有return，就返回null return null; }; // 获取哈希表中所有的key,返回一个数组 this.getAllKeys = function () { var keys = []; for (var prop in res) { keys.push(prop); } return keys; }; // 获取哈希表中记录的条数，返回一个数值 this.getSize = function () { return size; }; // 清空哈希表，无返回值 this.clear = function () { size = 0; res = {}; }; }

Copy after login

Part 3: Application Example

Problem: Given an integer array (unordered), find two of them numbers such that their sum is a specified value, and returns the subscripts of the two numbers (array subscripts start from 0), assuming that the values of the array elements are different.

The implementation is as follows:

    哈希表的使用

Copy after login

I believe you have mastered the method after reading the case in this article. For more exciting information, please pay attention to other related articles on the php Chinese website!