/**
* 判断两个字符串的最大相同字符串
*/
package java160117;
/**
* @author LiZheng
*
*/
public class StringTest3 {
/**
* @param args
*/
public static void main(String[] args) {
String string1 ="abcwerhelloyuiodef";
String string2 ="cvhello";
sop(getMaxSubString(string1, string2));
}
public static String getMaxSubString(String string1,String string2) {
String max,min;
max=(string1.length()>string2.length())? string1 :string2;
min =(max==string1) ? string2 :string1;
sop("max="+max+"\n"+"min="+min);
for (int x = 0; x < min.length(); x++) {
for (int y = 0, z=min.length()-x; z !=min.length()+1; y++,z++) {
String temp =min.substring(y, z);
// sop(temp);
// if (max.contains(temp)) {
// return temp;
// }
if ((max.indexOf(temp))!=-1) {
return temp;
}
}
}
return null;
}
public static void sop(String string) {
System.out.println(string);
}
}
* 判断两个字符串的最大相同字符串
*/
package java160117;
/**
* @author LiZheng
*
*/
public class StringTest3 {
/**
* @param args
*/
public static void main(String[] args) {
String string1 ="abcwerhelloyuiodef";
String string2 ="cvhello";
sop(getMaxSubString(string1, string2));
}
public static String getMaxSubString(String string1,String string2) {
String max,min;
max=(string1.length()>string2.length())? string1 :string2;
min =(max==string1) ? string2 :string1;
sop("max="+max+"\n"+"min="+min);
for (int x = 0; x < min.length(); x++) {
for (int y = 0, z=min.length()-x; z !=min.length()+1; y++,z++) {
String temp =min.substring(y, z);
// sop(temp);
// if (max.contains(temp)) {
// return temp;
// }
if ((max.indexOf(temp))!=-1) {
return temp;
}
}
}
return null;
}
public static void sop(String string) {
System.out.println(string);
}
}