From 3743f6eb4bac2c37f7c664031c1b7f67f55d119b Mon Sep 17 00:00:00 2001
From: Thomas A Caswell <tcaswell@bnl.gov>
Date: Mon, 6 Jul 2015 11:48:51 -0400
Subject: [PATCH] FIX: fix off-by-one bug

---
 exercises/03-wrapping/01-levenshtein/levenshtein.c | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/exercises/03-wrapping/01-levenshtein/levenshtein.c b/exercises/03-wrapping/01-levenshtein/levenshtein.c
index 47be399..a497403 100644
--- a/exercises/03-wrapping/01-levenshtein/levenshtein.c
+++ b/exercises/03-wrapping/01-levenshtein/levenshtein.c
@@ -2,6 +2,7 @@
 #include <string.h>
 #include <stdlib.h>
 
+
 #define MIN2(a, b) ((a) < (b) ? (a) : (b))
 #define MIN3(a, b, c) (MIN2((c), MIN2((a), (b))))
 
@@ -15,7 +16,7 @@ int levenshtein_dist(const char *s, const char *t)
     for (i=1; i<m+1; ++i)
         d[i*(n+1)] = i;
 
-    for (j=1; j<n+1; ++j)
+    for (j=0; j<n+1; ++j)
         d[j] = j;
 
     for (j=1; j<n+1; ++j) {
@@ -32,10 +33,12 @@ int levenshtein_dist(const char *s, const char *t)
         }
     }
 
+    int out = d[m * (n+1) + n];
+
     if(d)
         free(d);
+    return out;
 
-    return d[m * (n+1) + n];
 
 fail:
     return -1;