String 字符串匹配算法

• 查找主串（goodgoogle）中是否存在子串（google）

代码：

package com.bai.webflux.webfluxdemo.test;


public class StringTest {

    public static void main(String[] args) {
        String s = "goodgoogle";
        String t = "google";
        int isfind = 0;

        for (int i = 0; i < s.length() - t.length() + 1; i++) {
            if (s.charAt(i) == t.charAt(0)) {
                int jc = 0;
                for (int j = 0; j < t.length(); j++) {
                    if (s.charAt(i + j) != t.charAt(j)) {
                        break;
                    }
                    jc = j;
                }
                if (jc == t.length() - 1) {
                    isfind = 1;
                }
            }
        }
        System.out.println(isfind);
    }
}


输出： 1

• 查找出两个字符串的最大公共字串

package com.bai.webflux.webfluxdemo.test;


public class StringTest {

    public static void main(String[] args) {
        String a = "123456";
        String b = "13452439";
        String maxSubStr = "";
        int max_len = 0;

        for (int i = 0; i < a.length(); i++) {
            for (int j = 0; j < b.length(); j++){
                if (a.charAt(i) == b.charAt(j)){
                    for (int m=i, n=j; m<a.length()&&n<b.length(); m++,n++) {
                        if (a.charAt(m) != b.charAt(n)){
                            break;
                        }
                        if (max_len < m-i+1){
                            max_len = m-i+1;
                            maxSubStr = a.substring(i, m+1);
                        }
                    }
                }
            }
        }
        System.out.println(maxSubStr);
    }
}

输出：345