在C中打印最长公用子字符串的代码

#include <stdio.h>
#include <string.h>

void printLongestCommonSubstring(char* str1, char* str2) {
    int len1 = strlen(str1);
    int len2 = strlen(str2);

    int maxLength = 0;  // 最长公共子串的长度
    int endIndex = 0;   // 最长公共子串的结束索引

    int dp[len1 + 1][len2 + 1];  // 动态规划表格
    memset(dp, 0, sizeof(dp));

    for (int i = 1; i <= len1; i++) {
        for (int j = 1; j <= len2; j++) {
            if (str1[i - 1] == str2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
                if (dp[i][j] > maxLength) {
                    maxLength = dp[i][j];
                    endIndex = i - 1;  // 更新最长公共子串的结束索引
                }
            }
        }
    }

    if (maxLength == 0) {
        printf("No common substring found.\n");
        return;
    }

    printf("Longest common substring: ");
    for (int i = endIndex - maxLength + 1; i <= endIndex; i++) {
        printf("%c", str1[i]);
    }
    printf("\n");
}

int main() {
    char str1[] = "abcdefg";
    char str2[] = "defghij";

    printLongestCommonSubstring(str1, str2);

    return 0;
}