编辑代码

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

// 返回两个整数中的最大值
int max(int a, int b) {
    return (a > b) ? a : b;
}

// 使用动态规划解决最大公共字符串子序列问题
int longestCommonSubsequence(char* text1, char* text2) {
    int m = strlen(text1);
    int n = strlen(text2);
    int dp[m + 1][n + 1];

    // 初始化边界条件
    for (int i = 0; i <= m; i++)
        dp[i][0] = 0;
    for (int j = 0; j <= n; j++)
        dp[0][j] = 0;

    // 填表求解
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            if (text1[i - 1] == text2[j - 1])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            else
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        }
    }

    return dp[m][n];
}

int main() {
    char text1[] = "abcde";
    char text2[] = "ace";
    int result = longestCommonSubsequence(text1, text2);
    printf("最长公共子序列的长度: %d\n", result);

    return 0;
}