| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
1 file changed
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -8,7 +8,7 @@ export default function levenshteinDistance(a, b) { | |||
| 8 | 8 | // substrings of a to substrings of b. | |
| 9 | 9 | const distanceMatrix = Array(b.length + 1).fill(null).map(() => Array(a.length + 1).fill(null)); | |
| 10 | 10 | ||
| 11 | - // Fill the first raw of the matrix. | ||
| 11 | + // Fill the first row of the matrix. | ||
| 12 | 12 | // If this is first row then we're transforming empty string to a. | |
| 13 | 13 | // In this case the number of transformations equals to size of a substring. | |
| 14 | 14 | for (let i = 0; i <= a.length; i += 1) { | |
| Back | FazBrowse Home | New Git URL |
0 commit comments