multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-13 16:17:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revert: Update test.js

Browse Source
This commit is contained in:
multipleof4
2025-11-13 16:49:27 -08:00
parent 53833b2084
commit d33b11c8fd
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tests/3_lis/test.js
View File

@@ -5,16 +5,14 @@ export default {
// - You MUST implement the efficient O(n log n) algorithm.
// - You MUST use a dynamic import() to load the 'd3-array' library from a CDN and use its 'bisectLeft' function to achieve O(n log n) complexity.
// - The function should return a single number: the length of the LIS.`,
getTestCases: () => {
const nums = [10, 9, 2, 5, 3, 7, 101, 18, 4, 6];
return [nums];
},
runTest: async (findLISLength) => {
const assert = {
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },
};
const [nums] = globalThis.getTestCases ? globalThis.getTestCases() : this.getTestCases();
const nums = [10, 9, 2, 5, 3, 7, 101, 18, 4, 6];
const length = await findLISLength(nums);
assert.strictEqual(length, 4, "Test Failed: LIS length should be 4.");
}
};