File size: 997 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 |
public class LCSMemoization{
int lcs(char x[], char y[] , int i, int j, int m[][])
{
int N = x.length;
int M = y.length;
if(i==N || j==M)
return 0;
if(m[i][j] != -1)
return m[i][j];
if(x[i] == y[j])
{
m[i][j] = lcs(x,y,i+1,j+1,m)+1;
}
else
m[i][j] = max(lcs(x,y,i+1,j,m), lcs(x,y,i,j+1,m));
return m[i][j];
}
int max(int a,int b){
return (a>b)?a:b;
}
public static void main(String[] args){
LCSMemoization l = new LCSMemoization();
String s1 = "one";
String s2 = "longest";
int m[][] = new int[101][101];
char x[] = s1.toCharArray();
char y[] = s2.toCharArray();
//System.out.println(x.length);
//System.out.println(y.length);
int m1 = s1.length();
int n = s2.length();
for(int i=0; i<100;i++){
for(int j=0;j <100; j++){
m[i][j] = -1;
}
}
int k = l.lcs(x,y,0,0,m);
System.out.println(k);
}
}
|