计算机科学 - 2026 进行中

科目: 计算机科学
级别: XI (I级最简单，XII级最难)
类别: 大学生
试题语言: English
题数: 15
问题示例: Which string-matching algorithm preprocesses a pattern using a prefix-function table and guarantees O(n + m) time for searching a pattern of length m in a text of length n? Rabin–Karp, Boyer–Moore, Knuth–Morris–Pratt, Floyd–Warshall