Save changes

Author: Adrian333Dev

implementations/hash_tables/challenges/design-hashmap.js renamed to implementations/hashmap/challenges/design-hashmap.js

@@ -10,36 +10,33 @@ class MyHashSet {
 	}
 
 	add(key) {
-		let idx = this._hash(key),
-			node = this.set[idx];
+		let idx = this._hash(key), node = this.set[idx];
 		if (!node) this.set[idx] = new Node(key);
 		else {
-			while (node.next) node = node.next;
+			while (node.next && node.value !== key) node = node.next;
+			if (node.value === key) return;
 			node.next = new Node(key);
 		}
 		this.size++;
 		if (this.size > this.max * 0.7) this._rehash();
 	}
 
 	remove(key) {
-		let idx = this._hash(key),
-			node = this.set[idx];
-		console.log(idx, node);
+		let idx = this._hash(key), node = this.set[idx];
 		if (!node) return;
 		else if (node.value === key) this.set[idx] = node.next;
 		else {
 			while (node.next && node.next.value !== key) node = node.next;
 			if (!node.next) return;
 			node.next = node.next.next;
 		}
-		console.log(this.set[idx]);
 		this.size--;
 		if (this.size < this.max * 0.2) this._rehash();
 	}
 
 	contains(key) {
 		let node = this.set[this._hash(key)];
-		while (node && node.value !== key) node = node.next;
+		while (node && node.value !== key) node = node.next; 
 		return !!node;
 	}
 
@@ -58,9 +55,7 @@ class MyHashSet {
 	}
 
 	_nextPrime() {
-		const min = this.max * 1.5,
-			max = this.max * 3;
-		const sieve = new Array(max + 1).fill(true);
+		const min = this.max * 1.5, max = this.max * 3, sieve = new Array(max + 1).fill(true);
 		sieve[0] = sieve[1] = false;
 		for (let i = 2; i <= Math.sqrt(max); i++)
 			if (sieve[i]) for (let j = i * i; j <= max; j += i) sieve[j] = false;
@@ -69,12 +64,10 @@ class MyHashSet {
 	}
 
 	_rehash() {
-		this.max *= 2;
+		this.max *= this._nextPrime();
 		const oldSet = this.set;
 		this.set = new Array(this.max).fill(null);
-		oldSet.forEach((node) => {
-			while (node) this.add(node.value), (node = node.next);
-		});
+		for (let node of oldSet) while (node) this.add(node.value), (node = node.next);
 	}
 }
 

implementations/hash_tables/challenges/design-hashset.js renamed to implementations/hashmap/challenges/design-hashset.js

@@ -4,14 +4,10 @@
  */
 const createCounter = (n) => {
 	let counter = n;
-	return function () {
-		return counter++;
-	};
+	return () => counter++;
 };
 
-/**
- * const counter = createCounter(10)
- * counter() // 10
- * counter() // 11
- * counter() // 12
- */
+const counter = createCounter(10);
+console.log(counter()); // 10
+console.log(counter()); // 11
+console.log(counter()); // 12

leetcode_30_days_js/02_counter.js

@@ -0,0 +1,19 @@
+/**
+ * @param {string} val
+ * @return {Object}
+ */
+const expect = (val) => {
+	return {
+		toBe: (newVal) => {
+			if (newVal !== val) throw new Error('Not Equal');
+			return true;
+		},
+		notToBe: (newVal) => {
+			if (newVal === val) throw new Error('Equal');
+			return true;
+		},
+	};
+};
+
+console.log(expect(5).toBe(5)); // true
+console.log(expect(5).notToBe(5)); // Error: Equal

leetcode_30_days_js/03_to-be-or-not-to-be.js

@@ -11,9 +11,7 @@ var createCounter = function (init) {
 	};
 };
 
-/**
- * const counter = createCounter(5)
- * counter.increment(); // 6
- * counter.reset(); // 5
- * counter.decrement(); // 4
- */
+const counter = createCounter(5);
+console.log(counter.increment()); // 6
+console.log(counter.increment()); // 7
+console.log(counter.increment()); // 8

leetcode_30_days_js/03_counter-2.js renamed to leetcode_30_days_js/04_counter-2.js

@@ -0,0 +1,13 @@
+/**
+ * @param {number[]} arr
+ * @param {Function} fn
+ * @return {number[]}
+ */
+const map = (arr, fn) => {
+	const res = [];
+	for (let i = 0; i < arr.length; i++) res.push(fn(arr[i], i));
+	return res;
+};
+
+const test = map([1, 2, 3, 4, 5], (v) => v * 2);
+console.log(test);