新增解决哈希表地址冲突

Author: heshihaoCoder

散列表（hashMap）/index.js

@@ -28,6 +28,6 @@ HashTable.prototype.remove = function (key) {
   this.table[LoseLoseHashCode(key)] = undefined
 }
 
-let hash = new HashTable()
-hash.put('heshihao', 99)
+
+
 

散列表（hashMap）/链地址法解决冲突.js

@@ -0,0 +1,68 @@
+// 上面的会出现地址冲突  所以我们需要在每个地址上让他成为一个链表
+function HashTable() {
+  this.table = []
+}
+
+let ValuePair = function (key, value) {
+  this.key = key
+  this.value = value
+  this.toString = function () {
+    return '[' + this.key + ' - ' + this.value + ']';
+  }
+}
+
+// 重写put 方法
+HashTable.prototype.put = function (key, value) {
+  var postition = LoseLoseHashCode(key)
+  if (this.table[postition] == undefined) {
+    this.table[postition] = new linklist()
+  }
+  // append 参见链表数据结构
+  this.table[postition].append(new ValuePair(key, value))
+}
+
+// 重写get方法
+HashTable.prototype.get = function (key) {
+  let pos = LoseLoseHashCode(key)
+  if (this.table[pos] != undefined) {
+    // getHead 参见链表数据结构
+    let current = this.table[pos].getHead()
+    while (current.next) {
+      if (current.ele.key == key) {
+        return current.ele.value
+      }
+      current = current.next
+    }
+    if (current.ele.key == key) {
+      return current.ele.value
+    }
+  }
+  return undefined
+}
+
+// 重写移除方法
+HashTable.prototype.remove = function (key) {
+  let pos = LoseLoseHashCode(key)
+  if (this.table[pos] !== undefined) {
+    let current = new linklist.getHead()
+    while (current.next) {
+      if (current.ele.key == key) {
+        this.table[pos].remove(current.ele)
+        if (table[position].isEmpty()) {
+          table[position] = undefined;
+        }
+        return true
+      }
+      current = current.next
+    }
+    if (current.element.key === key) { //{16} 
+      this.table[pos].remove(current.element);
+      if (this.table[pos].isEmpty()) {
+        this.table[pos] = undefined;
+      }
+      return true;
+    }
+  } else {
+    return false
+  }
+}

链表数据结构（linklist）/index.js

@@ -98,7 +98,7 @@ LinkedList.prototype.remove = function (ele) {
 // 元素所在的位置
 LinkedList.prototype.indexOf = function (ele) {
   let current = this.head;
-  let index = -1;
+  let index = 0;
   while (current) {
     if (current.item == ele) {
       return index