求两个字符串的最大交集,输出这个字符串和其长度

Public static BigestCommonSubString{

Public staticvoid main(String [] args){

    String s1=”andbskgd”;

    String s2=”hfswbmfkmd”;

    StringtargetString=getSubString(str1,str2);

    System.out.println(targetString);

}

Public staticString getSubString(String s1,String s2){

    String targetString = null;

    String shorter=str1.length()>str2.length()?Str2:str1;

    String longer=shorter.equals(str1)? Str2:str1;

    For(int subLength =shorter.length();subLength>0;i--){

       For(i=0;i+subLength<shorter.length();i++){

          String substring=shorter.subString(I,i+subLength);

          If(longer.indexOf(subString)>=0){

             targetString=substring;

             breakout;

}

}

}

Return targetString;

}

}


猜你喜欢

转载自blog.csdn.net/qq_22313585/article/details/79158451