招银网络测开一面面经

def longest_common_subsequence(text1, text2): m, n = len(text1), len(text2) # 创建二维数组dp，用于保存中间结果 dp = [[0] * (n + 1) for _ in range(m + 1)] for i in range(1, m + 1): for j in range(1, n + 1): 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]

二面有面经吗

哥，项目问的多吗，我没有软件测试相关项目怎么办