Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
假设我有 2 个大小为 10^5 的大字符串，我如何使用哈希和二进制搜索从复杂度为 O(NlogN) 的两个字符串中搜索最大公共子字符串。用代码解释会有很大帮助:)