【数据结构】【字符串】【找相同子串】

https://www.bilibili.com/video/BV1Kb411W75N?p=477

package com.aiguigu.exer;

import org.junit.Test;

public class StringDemo {

    /*用双指针，双重遍历
    * 将短的字符串进行长度依次递减的子串与较长的串比较  类似最大公约数*/
    public String getMaxSameString(String str1,String str2){

        String maxStr = (str1.length() >= str2.length())? str1 :str2;
        String minStr = (str1.length() < str2.length())? str1 :str2;

        int length = minStr.length();
        for (int i = 0; i < length; i++) {

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

    @Test
    public void testGeCount(){

    }
}