hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

addressed issue 1033, changed while to if in LinkedList and add new before Array in HashTable constructor

Browse Source
This commit is contained in:
tmichell13 2023-05-08 16:19:27 -04:00
parent 8c5e5f4f0d
commit 085bb2973e
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/data-structures/hash-table/HashTable.js
View File

@ -12,7 +12,7 @@ export default class HashTable {
*/ */
constructor(hashTableSize = defaultHashTableSize) { constructor(hashTableSize = defaultHashTableSize) {
// Create hash table of certain size and fill each bucket with empty linked list. // Create hash table of certain size and fill each bucket with empty linked list.
this.buckets = Array(hashTableSize).fill(null).map(() => new LinkedList()); this.buckets = new Array(hashTableSize).fill(null).map(() => new LinkedList());
// Just to keep track of all actual keys in a fast way. // Just to keep track of all actual keys in a fast way.
this.keys = {}; this.keys = {};

2
src/data-structures/linked-list/LinkedList.js
View File

@ -101,7 +101,7 @@ export default class LinkedList {
// If the head must be deleted then make next node that is different // If the head must be deleted then make next node that is different
// from the head to be a new head. // from the head to be a new head.
while (this.head && this.compare.equal(this.head.value, value)) { if (this.head && this.compare.equal(this.head.value, value)) {
deletedNode = this.head; deletedNode = this.head;
this.head = this.head.next; this.head = this.head.next;
} }