LCS.java

package dynamicProgramming.longestcommonsubsequence;

public class LCS {
    public static void main(String[] args){
        char[] x = {'A','L','I'};
        char[] y = {'A','L','I','R','E','Z','A'};
        int lcs = longestCommonSubsequence(x,y,x.length,y.length);
        System.out.println(lcs);
    }
    public static int longestCommonSubsequence(char[] x, char[] y, int m, int n){
        if( m == 0 || n == 0){
            return 0;
        }
        if (x[m-1] == y[n -1]){
            return longestCommonSubsequence(x,y,m-1,n-1) + 1;
        }else{
            int p = longestCommonSubsequence(x,y,m,n-1);
            int q = longestCommonSubsequence(x,y,m -1,n);
            int max = Math.max(p,q);
            return max;
        }
    }
}