求两个字符串的最长公共子串

最新推荐文章于 2024-06-20 18:00:24 发布

百味珍果糖

最新推荐文章于 2024-06-20 18:00:24 发布

阅读量428

点赞数 11

文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/qq_38327117/article/details/135233243

版权

视频讲解：
https://www.bilibili.com/video/BV1hv41117gC/?spm_id_from=333.788.recommend_more_video.0&vd_source=0b928a12dede193d54766685a9e5a932

import java.util.Arrays;
import java.util.Scanner;

public class SelectRepeatCode {

    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);

        String str1 = sc.nextLine();
        String str2 = sc.nextLine();

        System.out.println(getResult(str1,str2));
    }
    public static String getResult(String str1,String str2){
        int n = str1.length();
        int m = str2.length();

        int[][] dp = new int[n+1][m+1];

        int max = 0;
        String ans = "";

        for (int i = 1; i<= n; i++){
            for (int j = 1; j<=m; j++){
                if (str1.charAt(i-1) == str2.charAt(j-1)){
                    //dp[i-1][j-1]代表前面的字符串（长度）
                    dp[i][j] = dp[i-1][j-1] + 1;    

                    if (dp[i][j] > max){
                        max = dp[i][j];
                        ans = str1.substring(i - max,i);
                    }
                }
                else{
                    dp[i][j] = 0;
                }
            }
        }
//        for (int i = 0; i < dp.length; i++){
//            String dps = Arrays.toString(dp[i]);
//            System.out.println(dps);
//        }

        return ans;
    }
}