longest string in texts

Posted by davit-datuashvili on Stack Overflow See other posts from Stack Overflow or by davit-datuashvili
Published on 2010-05-03T08:33:15Z Indexed on 2010/05/03 8:38 UTC
Read the original article Hit count: 445

Filed under:

ok i have meet following problem too for example there is given two text find longest string that occur in both i think we should cretate string array where we should put common srings and then compare their length and which length will be largest print it is there fast method?

© Stack Overflow or respective owner

longest string in texts

Posted by davit-datuashvili on Stack Overflow See other posts from Stack Overflow or by davit-datuashvili
Published on 2010-05-03T11:02:49Z Indexed on 2010/05/03 11:08 UTC
Read the original article Hit count: 445

Filed under:

Ihave following code in Java:

import java.util.*;
public class longest{
public static void main(String[] args){
int t=0;int m=0;int token1, token2;
   String words[]=new String[10];
    String word[]=new String[10];
String common[]=new String[10];
   String text="saqartvelo gabrwyindeba da gadzlierdeba aucileblad ";
     String text1="saqartvelo gamtliandeba da gadzlierdeba aucileblad";
StringTokenizer st=new StringTokenizer(text);
StringTokenizer st1=new StringTokenizer(text1);

token1=st.countTokens();
token2=st1.countTokens();
while (st.hasMoreTokens()){

words[t]=st.nextToken();
  t++;
}
  while (st1.hasMoreTokens()){
     word[m]=st1.nextToken();
  m++;
}
 for (int k=0;k<token1;k++){
     for (int f=0;f<token2;f++){
      if (words[f].compareTo(word[f])==0){
  common[f]=words[f];
}
}
}
   while (i<common.length){
   System.out.println(common[i]);
   i++;
}
}
}

I want that in common array put elements which i in both text or these words

  • saqartvelo (georgia in english)
  • da (and in english)
  • gadzlierdeba (will be stronger)
  • aucileblad (sure)

and then between these words find string which has maximum length but it does not work more correctly it show me these words and also many null elements.

How do I correct it?

© Stack Overflow or respective owner

Related posts about algorithm