day13/MySubstring.java

来源：互联网发布：js将list转换为数组编辑：程序博客网时间：2024/06/17 00:22

/*4.获取两个字符串中最大相同子串。第一个动作：将短的那个串进行长度依次递减的子串打印。"abcwerthelloyuiodef""cvhellobnm"思路：1.将短的那个子串按照长度递减的方式获取到。2.将每获取到的子串去长串中判断是否包含。如果包含，已经找到。cvhellobnm| |cvhellobnm|| | |cvhellobnm|      |   |      |    |      |   ......*/class MySubstring{public static void sop(Object obj){System.out.println(obj);}public static String getMaxString(String s1,String s2){String maxString=(s1.length()>s2.length())?s1:s2;String minString=(maxString==s1)?s2:s1;//判断s1和s2的长度，把长串分配给s1,短串给s2,因为要遍历短串去匹配长串。for(int x=0;x<minString.length();x++){for(int y=0,z=minString.length()-x;z!=minString.length()+1;y++,z++){String temp_str=minString.substring(y,z);if(maxString.contains(temp_str))return temp_str;}}return null;}public static void main(String[] args) {String s1="cvhellobnm";String s2="abcwerthelloyuiodef";sop(getMaxString(s1,s2));}}

0 0