题解 | #查找两个字符串a,b中的最长公共子串#

//暴力解法，从短到长遍历子串
#include <stdio.h>
#include <string.h>
void check(char* str1, int len1, char* str2, int len2, char* result)
{
    int max = 0;
    for (int i = 1; i <= len1; i++)
    {
        for (int j = 0; j <= len1 - i; j++)
        {
            char std[301] = { 0 };
            strncpy(std, &str1[j], i);
            char* p = strstr(str2,std);
            int len3 = strlen(std);
            if (p != NULL && max <len3)
            {
                max =len3;
                strcpy(result, std);
                break;
            }
        }
    }
}
int main() {
    char str1[301] = { 0 };
    char str2[301] = { 0 };
    char result[301] = { 0 };
    scanf("%s", str1);
    scanf("%s", str2);
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    if (len1 < len2)
        check(str1, len1, str2, len2, result);
    else
        check(str2, len2, str1, len1, result);
    printf("%s\n", result);
    return 0;
}