refactor 72

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_72.java

@@ -1,19 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 72. Edit Distance
- *
- * Given two words word1 and word2,
- * find the minimum number of steps required to convert word1 to word2.
- * (each operation is counted as 1 step.)
-
- You have the following 3 operations permitted on a word:
-
- a) Insert a character
- b) Delete a character
- c) Replace a character
- */
-
 public class _72 {
 
     public static class Solution1 {
@@ -43,7 +29,7 @@ public int minDistance(String word1, String word2) {
                         cost = 1;
                     }
                     table[i][j] = Math.min(Math.min(table[i - 1][j] + 1, table[i][j - 1] + 1),
-                        table[i - 1][j - 1] + cost);
+                            table[i - 1][j - 1] + cost);
                 }
             }
             return table[m][n];