algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 08:16:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* chore: Switch to Node 20 + Vitest

* chore: migrate to vitest mock functions

* chore: code style (switch to prettier)

* test: re-enable long-running test

Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!

see #1193

* chore: code style

* chore: fix failing tests

* Updated Documentation in README.md

* Update contribution guidelines to state usage of Prettier

* fix: set prettier printWidth back to 80

* chore: apply updated code style automatically

* fix: set prettier line endings to lf again

* chore: apply updated code style automatically

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
This commit is contained in:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
Dynamic-Programming/LongestCommonSubsequence.js
View File

@ -27,11 +27,12 @@ References:
* @param {string} str2 Input string #2
* @returns {number} Length of the longest common subsequence
*/
function longestCommonSubsequence (str1, str2) {
const memo = new Array(str1.length + 1).fill(null)
function longestCommonSubsequence(str1, str2) {
const memo = new Array(str1.length + 1)
.fill(null)
.map(() => new Array(str2.length + 1).fill(null))
function recursive (end1, end2) {
function recursive(end1, end2) {
if (end1 === -1 || end2 === -1) {
return 0
}