algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +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

13
Dynamic-Programming/LevenshteinDistance.js
View File

@ -7,7 +7,7 @@
* @see [Levenshtein_distance](https://en.wikipedia.org/wiki/Levenshtein_distance)
*/
function minimum (a, b, c) {
function minimum(a, b, c) {
if (a < b && a < c) {
return a
} else if (b < a && b < c) {
@ -17,12 +17,12 @@ function minimum (a, b, c) {
}
}
function costOfSubstitution (x, y) {
function costOfSubstitution(x, y) {
return x === y ? 0 : 1
}
// Levenshtein distance between x and y
function calculateLevenshteinDp (x, y) {
function calculateLevenshteinDp(x, y) {
const dp = new Array(x.length + 1)
for (let i = 0; i < x.length + 1; i++) {
dp[i] = new Array(y.length + 1)
@ -35,7 +35,12 @@ function calculateLevenshteinDp (x, y) {
} else if (j === 0) {
dp[i][j] = i
} else {
dp[i][j] = minimum(dp[i - 1][j - 1] + costOfSubstitution(x.charAt(i - 1), y.charAt(j - 1)), dp[i - 1][j] + 1, dp[i][j - 1] + 1)
dp[i][j] = minimum(
dp[i - 1][j - 1] +
costOfSubstitution(x.charAt(i - 1), y.charAt(j - 1)),
dp[i - 1][j] + 1,
dp[i][j - 1] + 1
)
}
}
}