最长公共子串【动态规划】

include <iostream>

include <string>

using namespace std;

int max(int x, int y){

return x >= y ? x : y;

}

int main(){

string str1;
string str2;

cout<<"请输入2个字符串"<<endl;

cin>>str1>>str2;

int len1 = str1.length();
int len2 = str2.length();
int result = 0;

char c [len1+1][len2+1];

for(int i = 0; i <= len1; i++)
for(int j = 0; j <= len2; j++){
    
    if( i == 0 || j == 0){
        
        c[i][j] = 0;
        
    }else if( str1[i-1] == str2[j-1] ){
        
        c[i][j] = c[i-1][j-1] + 1;
        
        result = max( c[i][j], result); 
    }else{
        
        c[i][j] = 0;
    }
} 

cout<<"最长公共子串数量为:"<<result<<endl;

}

推荐阅读更多精彩内容