[leecode] get the longest common substring of two strings

Longest continuous substring

Log in and copy

      
      

       
       package 
       
       com.
       
       company;
       
       

       
       import 
       
       java.
       
       util.
       
       *;
       
       

       
       

       
       

       
       //  obtain 2 The longest common substring of a string 
       
       

       
       public 
       
       class 
       
       Solution {
       
       
    
       
       public 
       
       static 
       
       void 
       
       main(
       
       String[] 
       
       args) {
       
       
        
       
       String 
       
       str 
       
       = 
       
       "ABCDEFG";
       
       
        
       
       String 
       
       sss 
       
       =
       
       "bdsafsadfABCDEFfdsafsdfsdQWE";
       
       
        
       
       maxCommon(
       
       sss, 
       
       str);
       
       
    }
       
       

       
       

       
       
    
       
       private 
       
       static 
       
       void 
       
       maxCommon(
       
       String 
       
       s1, 
       
       String 
       
       s2) {
       
       
        
       
       if(
       
       s1.
       
       length() 
       
       == 
       
       0 
       
       || 
       
       s2.
       
       length() 
       
       == 
       
       0) 
       
       return;
       
       
        
       
       
        
       
       List
       
       <
       
       String
       
       > 
       
       list 
       
       = 
       
       new 
       
       ArrayList
       
       <>();
       
       
        
       
       for(
       
       int 
       
       i 
       
       = 
       
       s1.
       
       length(); 
       
       i 
       
       >= 
       
       0; 
       
       i
       
       --){
       
       
            
       
       for(
       
       int 
       
       j 
       
       = 
       
       0; 
       
       j 
       
       + 
       
       i 
       
       <= 
       
       s1.
       
       length(); 
       
       j
       
       ++){
       
       
                
       
       //  obtain s1 String of each length of 
       
       
                
       
       String 
       
       ss 
       
       = 
       
       s1.
       
       substring(
       
       j, 
       
       i
       
       +
       
       j);
       
       
                
       
       //  Judge whether the value is S2 in 
       
       
                
       
       if(
       
       s2.
       
       indexOf(
       
       ss) 
       
       != 
       
       -
       
       1){
       
       
                    
       
       list.
       
       add(
       
       ss);
       
       
                    
       
       break;
       
       
                }
       
       
            }
       
       
        }
       
       
        
       
       // list Is incrementally recording all duplicate values 
       
       
        
       
       System.
       
       out.
       
       println(
       
       list.
       
       get(
       
       0));
       
       
    }
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.