fix build

fishercoder1534 · fishercoder1534 · commit 35e2d66648cf · 2020-11-14T09:59:23.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_72.java b/src/main/java/com/fishercoder/solutions/_72.java
@@ -37,34 +37,35 @@ public int minDistance(String word1, String word2) {
             return table[m][n];
         }
     }
-    public static class Solution2{
+
+    public static class Solution2 {
         public int minDistance(String word1, String word2) {
             // using levenshtein Distance to find minimum transformation operations required from word 1 to word 2
             int[][] dp = new int[word1.length()][word2.length()];
             // fill the dp array with -1 value
-            for(int [] rows : dp){
+            for (int[] rows : dp) {
                 Arrays.fill(rows, -1);
             }
-            return levenshteinDistance(word1, word1.length()-1 , word2, word2.length()-1, dp);
+            return levenshteinDistance(word1, word1.length() - 1, word2, word2.length() - 1, dp);
         }
-        private int levenshteinDistance( String s1, int s1Index, String s2, int s2Index, int[][] dp){
 
-            if(s1Index < 0){ // when s1 is "" perform all insertions to get s1 to s2
+        private int levenshteinDistance(String s1, int s1Index, String s2, int s2Index, int[][] dp) {
+
+            if (s1Index < 0) { // when s1 is "" perform all insertions to get s1 to s2
                 return s2Index + 1;
-            }
-            else if(s2Index < 0) { // when s2 is "" perform all deletions from s1
+            } else if (s2Index < 0) { // when s2 is "" perform all deletions from s1
                 return s1Index + 1;
             }
 
             // base condition when dp array is filled, return the distance
-            if(dp[s1Index][s2Index] != -1)
+            if (dp[s1Index][s2Index] != -1) {
                 return dp[s1Index][s2Index];
+            }
 
-            if(s1.charAt(s1Index) == s2.charAt(s2Index)){
+            if (s1.charAt(s1Index) == s2.charAt(s2Index)) {
                 // Characters match, no edit distance to be calculated
                 dp[s1Index][s2Index] = levenshteinDistance(s1, s1Index - 1, s2, s2Index - 1, dp);
-            }
-            else{
+            } else {
                 // When there is a character mismatch, perform operations
 
                 // Insertion
diff --git a/src/test/java/com/fishercoder/_72Test.java b/src/test/java/com/fishercoder/_72Test.java
@@ -13,7 +13,8 @@ public class _72Test {
 
     @BeforeClass
     public static void setup() {
-        solution1 = new _72.Solution1(); solution2 = new _72.Solution2();
+        solution1 = new _72.Solution1();
+        solution2 = new _72.Solution2();
     }
 
     @Test
@@ -25,4 +26,14 @@ public void test1() {
     public void test2() {
         assertEquals(5, solution1.minDistance("Ashmi", "Chheda"));
     }
+
+    @Test
+    public void test3() {
+        assertEquals(1, solution2.minDistance("Ada", "Adam"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(5, solution2.minDistance("Ashmi", "Chheda"));
+    }
 }
