def longest_common_substring(text1: str, text2: str) -> str: m, n = len(text1), len(text2) dp = [[0] * (n + 1) for _ in range(m + 1)] max_len = 0 end_pos = 0 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 if dp[i][j] > max_len: max_len = dp[i][j] end_pos = i else: dp[i][j] = 0 if max_len == 0: return "" return text1[end_pos - max_len : end_pos]# 自定义输入功能def main: print("请输入两行代码（每行输入后按回车确认）：") text1 = input("第一行代码：").strip text2 = input("第二行代码：").strip # 验证输入长度 if len(text1) 100 or len(text2) > 100: print("错误：输入的字符串长度必须在1到100之间") return result = longest_common_substring(text1, text2) print("\n最长公共子串是：", result if result else "空字符串")if __name__ == "__main__": main摘要：def longest_common_substring(text1: str, text2: str) -> str: m, n = len(text1), len(text2) dp = [[0] * (n + 1) for _ in range(m +
来源：勇帅说事
