描述

給定兩個只包含小寫字母的字串，計算兩個字串的最大公共子串的長度。

輸入描述：

輸入兩個只包含小寫字母的字串

輸出描述：

輸出一個整數，代表最大公共子串的長度

示例1

asdfas
werasdfaswer

6

 1 import java.util.*;
 2 
 3 public class Main {
 
 4     public static void main(String[] args) {
 5         Scanner sc = new Scanner(System.in);
 6         while(sc.hasNext()) {
 7             String s1 = sc.next();
 8             String s2 = sc.next();
 9             if(s1.length() < s2.length()) {
10                 System.out.println(calc(s1, s2));
 
11             }else {
12                 System.out.println(calc(s2, s1));
13             }
14         }
15     }
16     
17     public static int calc(String shortStr, String longStr) {
18         int count=0;
19 
20         
21         if(longStr.contains(shortStr)) {
22             count = shortStr.length();
 
23             return count;
24         }
25         int len = shortStr.length()-1;
26         while(len > 0) {
27             for(int i=0; i<shortStr.length(); i++) {  //對整個短字串進行比遍歷
28                 if(i+len <= shortStr.length()) {  //有邊界不能超出短字串
29                     if(longStr.contains(shortStr.substring(i,i+len))){
30                         count = shortStr.substring(i,i+len).length();
31                         return count;
32                     }
33                 }
34             }
35             len--;
36         }
37         return count;
38     }
39 }