Java 找到两个字符串包含的最大子字符串

最新推荐文章于 2023-10-22 01:43:35 发布

如是我闻CsDn

最新推荐文章于 2023-10-22 01:43:35 发布

阅读量187

点赞数

分类专栏： Java 文章标签： java 字符串正则表达式数据结构

本文链接：https://blog.csdn.net/E_chos/article/details/113345279

版权

Java 专栏收录该内容

54 篇文章 0 订阅

订阅专栏

找到两个字符串包含的最大子字符串-Java

public class stringdemo {
    /**
     * 找两个字符串包含的共同子字符串
     * 如果只有一个
     */
    public String findMaxStr(String str1, String str2) {
        if (str1 != null && str2 != null) {
            String maxStr = (str1.length() >= str2.length()) ? str1:str2;
            String minStr = (str1.length() < str2.length()) ? str1:str2;
            int minLength = minStr.length();


            for (int i = 0; i < minLength; i++) {
                for (int x = 0, y = minLength - i; y <= minLength; x++, y++) {
                    String subStr = minStr.substring(x, y);
                    if (maxStr.contains(subStr)) {
                        return subStr;
                    }
                }
            }
            return null;
        }
        return null;
    }

    @Test
    public void test3() {
        String str1 = "abahlglsfasdhgagoirhgabslsdahhagklab";
        String str2 = "abshfhkahdhgagofjakhsfaahllsl";
        String maxSubStr = findMaxStr(str1, str2);
        System.out.println(maxSubStr);
    }

    /**
     * 找两个字符串包含的共同子字符串
     * 如果含有多个
     */
    public String[] findMaxStr1(String str1, String str2) {
        if (str1 != null && str2 != null) {
            StringBuffer stringBuffer = new StringBuffer();
            String maxStr = (str1.length() >= str2.length()) ? str1:str2;
            String minStr = (str1.length() < str2.length()) ? str1:str2;
            int minLength = minStr.length();


            for (int i = 0; i < minLength; i++) {
                for (int x = 0, y = minLength - i; y <= minLength; x++, y++) {
                    String subStr = minStr.substring(x, y);
                    if (maxStr.contains(subStr)) {
                        stringBuffer.append(subStr + ",");
                        }
                    }
                if (stringBuffer.length() != 0) {
                    break;
                }
            }
            String[] maxSubStr = stringBuffer.toString().replaceAll(",$", "").split("\\,");
            return maxSubStr;
        }
        return null;
    }

    @Test
    public void test4() {
        String str1 = "abahlglsfasdhgagoirhgabslsdahhagklab";
        String str2 = "abshfhkahdhgagofjakhsfaahllslagklab";
        String[] maxSubStr = findMaxStr1(str1, str2);
        System.out.println(Arrays.toString(maxSubStr));
    }
}