编辑代码

def max_common_subsequence(str1, str2):
    m, n = len(str1), len(str2)
    # 创建一个二维数组来保存子问题的解
    dp = [[0] * (n + 1) for _ in range(m + 1)]

    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if str1[i - 1] == str2[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]

# 测试最大公共子序列问题
str1 = "ABCBDAB"
str2 = "BDCAB"
result = max_common_subsequence(str1, str2)
print(f"最大公共子序列长度: {result}")