Update for the Longest Common Subsequence algorithm

benaich · benaich · commit e28975cc4148 · 2015-02-17T16:58:02.000Z
diff --git a/DynamicProgramming/LCS.java b/DynamicProgramming/LCS.java
@@ -8,7 +8,6 @@ public static enum Direction {
     };
 
     public class Paire {
-
         public int cal;
         public Direction d;
 
@@ -110,11 +109,12 @@ public static String doYouMean(String query, String[] text){
         return text[max];
     }
     public static void main(String[] args) {
+        
         System.out.println(LCS.run("abcdbdab","bdcaba" ));
         
         String dbText[] = new String[]{"house of cards", "game of throne", "breaking bad"};
         
-        System.out.println("Do you mean " + LCS.doYouMean("gamz of trone", dbText));
+        System.out.println("Do you mean " + LCS.doYouMean("ga of Zrone", dbText));
     }
 
 }

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,6 @@ public static enum Direction {`
`8`	`8`	`};`
`9`	`9`
`10`	`10`	`public class Paire {`
`11`		`-`
`12`	`11`	`public int cal;`
`13`	`12`	`public Direction d;`
`14`	`13`
`@@ -110,11 +109,12 @@ public static String doYouMean(String query, String[] text){`
`110`	`109`	`return text[max];`
`111`	`110`	`}`
`112`	`111`	`public static void main(String[] args) {`
	`112`	`+`
`113`	`113`	`System.out.println(LCS.run("abcdbdab","bdcaba" ));`
`114`	`114`
`115`	`115`	`String dbText[] = new String[]{"house of cards", "game of throne", "breaking bad"};`
`116`	`116`
`117`		`- System.out.println("Do you mean " + LCS.doYouMean("gamz of trone", dbText));`
	`117`	`+ System.out.println("Do you mean " + LCS.doYouMean("ga of Zrone", dbText));`
`118`	`118`	`}`
`119`	`119`
`120`	`120`	`}`