Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 75f8d11

Browse files
chore(benchmarks): new files for benchmarks
1 parent 288ff77 commit 75f8d11

File tree

4 files changed

+66
-0
lines changed

4 files changed

+66
-0
lines changed
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
// Brute force: O(n^2) | O(1)
2+
function twoSum(nums, target) {
3+
for (let i = 0; i < nums.length - 1; i++) { // O(n^2)
4+
for (let j = i + 1; j < nums.length; j++) { // O(n)
5+
if (nums[i] + nums[j] === target) {
6+
return [i, j];
7+
}
8+
}
9+
}
10+
return [];
11+
}
12+
13+
module.exports = twoSum;
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
// With a HashMap: O(n) | O(n)
2+
function twoSum(nums, target) {
3+
const map = nums.reduce((m, v, i) => { // O(n)
4+
const ids = m.get(v) || [];
5+
ids.push(i);
6+
return m.set(v, ids);
7+
}, new Map());
8+
9+
for (let i = 0; i < nums.length; i++) { // O(n)
10+
const diff = target - nums[i];
11+
if (map.has(diff) && i !== map.get(diff)) {
12+
return [i, map.get(diff)];
13+
}
14+
}
15+
16+
return [];
17+
}
18+
19+
module.exports = twoSum;
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
// With a HashMap: O(n) | O(n), 1-pass
2+
function twoSum(nums, target) {
3+
const map = new Map();
4+
5+
for (let i = 0; i < nums.length; i++) { // O(n)
6+
const complement = target - nums[i];
7+
8+
if (map.has(complement)) {
9+
return [map.get(complement), i];
10+
}
11+
12+
map.set(nums[i], i);
13+
}
14+
15+
return [];
16+
}
17+
18+
module.exports = twoSum;
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
const assert = require('assert');
2+
3+
const twoSum = require('./01-two-sum');
4+
5+
function test() {
6+
assert.deepEqual(twoSum([1, 2, 3], 4), [0, 2]);
7+
assert.deepEqual(twoSum([1, 2, 3], 14), []);
8+
9+
assert.deepEqual(twoSum([2, 2, 2], 4), [0, 1]);
10+
assert.deepEqual(twoSum(Array(1e7).fill(2), 4), [0, 1]); //
11+
// assert.deepEqual(twoSum(Array(1e8).fill(2), 4), [0, 1]); // FATAL ERROR: Ineffective mark-compacts near heap limit Allocation failed - JavaScript heap out of memory
12+
// assert.deepEqual(twoSum(Array(1e9).fill(2), 4), [0, 1]); // 1e7 - error 137 - OUT OF MEMORY
13+
console.log('All tests passed!');
14+
}
15+
16+
test();

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /