From 41d11f2b6ed945e31c37d82186c794e46d2f6977 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Tom=C3=A1=C5=A1=20H=C3=BCbelbauer?= <tomas@hubelbauer.net>
Date: Thu, 24 May 2018 13:00:49 +0200
Subject: [PATCH] Fix a typo
---
.../string/levenshtein-distance/levenshteinDistance.js | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/src/algorithms/string/levenshtein-distance/levenshteinDistance.js b/src/algorithms/string/levenshtein-distance/levenshteinDistance.js
index 051e080eaa..f082f42a92 100644
--- a/src/algorithms/string/levenshtein-distance/levenshteinDistance.js
+++ b/src/algorithms/string/levenshtein-distance/levenshteinDistance.js
@@ -8,7 +8,7 @@ export default function levenshteinDistance(a, b) {
// substrings of a to substrings of b.
const distanceMatrix = Array(b.length + 1).fill(null).map(() => Array(a.length + 1).fill(null));
- // Fill the first raw of the matrix.
+ // Fill the first row of the matrix.
// If this is first row then we're transforming empty string to a.
// In this case the number of transformations equals to size of a substring.
for (let i = 0; i <= a.length; i += 1) {