/** * 散列表碰撞處理、開鏈法、HashTable散列。 * 將數(shù)組里的元素位置，也設(shè)置為數(shù)組，當(dāng)兩個(gè)數(shù)據(jù)的散列在同一個(gè)位置時(shí)， * 就可以放在這個(gè)位置的二維數(shù)組里，解決了散列函數(shù)的碰撞處理問題 */function HashTable() {  this.table = new Array(137);  this.betterHash = betterHash;//散列函數(shù)  this.showDistro = showDistro;//顯示散列表里的數(shù)據(jù)  this.buildChains = buildChains;//生成二維數(shù)組  this.put = put;//將數(shù)據(jù)存儲(chǔ)到散列表  this.get = get;//從散列表中取出某個(gè)數(shù)據(jù)}// put for separate chainingfunction put(key, data) {  var pos = this.betterHash(key);  var index = 0;  if (this.table[pos][index] == undefined) {    this.table[pos][index] = data;  }else {    while (this.table[pos][index] != undefined) {      ++index;    }    this.table[pos][index] = data;  }}/*散列函數(shù)*/function betterHash(string) {  const H = 37;  var total = 0;  for (var i = 0; i < string.length; ++i) {    total += H * total + string.charCodeAt(i);  }  total = total % this.table.length;  if (total < 0) {    total += this.table.length-1;  }  return parseInt(total);}function showDistro() {  var n = 0;  for (var i = 0; i < this.table.length; ++i) {    if (this.table[i][n] != undefined) {      console.log(i + ": " + this.table[i]);    }  }}function buildChains() {  for (var i = 0; i < this.table.length; ++i) {    this.table[i] = new Array();  }}// get for separate chainingfunction get(key) {  var index = 0;  var pos = this.betterHash(key);  while ((this.table[pos][index] != undefined)&&(this.table[pos][index] != key)) {    index += 1;  }  if(this.table[pos][index] == key) {    console.log(key+" 的鍵值為： "+this.table[pos][index]);    return this.table[pos][index];  }else{    console.log("無該鍵值");    return undefined;  }}/*測(cè)試開鏈法*/var someNames = ["David", "Jennifer", "Donnie", "Raymond",  "Cynthia", "Mike", "Clayton", "Danny", "Jonathan"];var hTable = new HashTable();hTable.buildChains();for (var i = 0; i < someNames.length; ++i) {  hTable.put(someNames[i],someNames[i]);}hTable.showDistro();hTable.betterHash("Jennifer");hTable.get("Jennidfer");hTable.get("Jennifer");