finds the length of longest common subsequence for given 2 Strings

Author: NirmalSilwal

Interview Prep/section19_DynamicProgramming/LongestCommonSubsequence.java

@@ -0,0 +1,30 @@
+package section19_DynamicProgramming;
+
+public class LongestCommonSubsequence {
+
+	public static void main(String[] args) {
+		String str1 = "abbg";
+		String str2 = "agbg";
+
+		System.out.println(lcs(str1, str2));
+	}
+
+	public static int lcs(String str1, String str2) {
+		if (str1.length() == 0 || str2.length() == 0)
+			return 0;
+
+		int count = 0;
+		String restString1 = str1.substring(1);
+		String restString2 = str2.substring(1);
+
+		if (str1.charAt(0) == str2.charAt(0)) {
+			count = 1 + lcs(restString1, restString2);
+		} else {
+			int factor1 = lcs(str1, restString2);
+			int factor2 = lcs(restString1, str2);
+			count = Math.max(factor1, factor2);
+		}
+
+		return count;
+	}
+}