Enjoy an ad free experience by logging in. Not a member yet? Register.

Results 1 to 2 of 2
Thread: Algorithm Test

11282010, 12:48 PM #1
 Join Date
 Nov 2010
 Posts
 2
 Thanks
 0
 Thanked 0 Times in 0 Posts
Algorithm Test
Hey!
I have a problem with an algortim I have to Find the Longrest
comnon substring between two strings
that should return a matrix if you have let say
"abcs" and "sac"
"" "" "" ""
"" "" "a" "a"
"" "" "a" "a"
"" "" "a" "ac"
"" "s" "s" "ac"
Code:public class Find { public static String find(String str1, String str2) { int i, j; int m = str1.length(); int n = str2.length(); String[][] b = new String [m][n]; for (int s = 1; s<m; s++) b[s][0] = ""; for (int z = 1; z<n; z++) b[0][z] = ""; for (i = 1; i<m; i++) for(j = 1; j<n; j++) { if(str1.charAt(i1) == str1.charAt(j1)) b[i][j] = b[i1][j1]+str1.charAt(+1); else if(b[i1][j].length() >= b[i][j1].length()) b[i][j]= b [i1][j]; else b[i][j] = b[i][j1]; } return b [m1][n1] } }
help so I can test if it actually work.

11282010, 01:16 PM #2
 Join Date
 Nov 2010
 Posts
 2
 Thanks
 0
 Thanked 0 Times in 0 Posts
Code:} return matrix [m1][n1] } public static void main(String [] args) { String str1 = "abbbccwwdw"; String str2 = "abbcddwdwd"; System.out.println(lcs(str1,str2)); } }
what is it that is wrong?