编辑代码

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

// 返回X和Y的最长公共子序列的长度
int longestCommonSubsequence(char *X, char *Y) {
    int m = strlen(X);
    int n = strlen(Y);

    int dp[m + 1][n + 1];

    // 填充动态规划表
    for (int i = 0; i <= m; i++) {
        for (int j = 0; j <= n; j++) {
            if (i == 0 || j == 0)
                dp[i][j] = 0;
            else if (X[i - 1] == Y[j - 1])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            else
                dp[i][j] = (dp[i - 1][j] > dp[i][j - 1]) ? dp[i - 1][j] : dp[i][j - 1];
        }
    }

    // 返回最长公共子序列的长度
    return dp[m][n];
}

int main() {
    char X[] = "ABCBDAB";
    char Y[] = "BDCAB";

    int result = longestCommonSubsequence(X, Y);

    printf("最长公共子序列的长度为: %d\n", result);

    return 0;
}