Last Updated：2025/12/04
Sentence
アルゴリズムの授業で、長いテキスト中のパターンのすべての出現を効率よく見つけるために、パターン自身の情報を使って不可能な一致位置を飛ばす線形時間の文字列検索アルゴリズムを実装しました。
Quizzes for review
In my algorithms class, we implemented the Knuth-Morris-Pratt algorithm to efficiently find all occurrences of a pattern in a long text.
See correct answer
In my algorithms class, we implemented the Knuth-Morris-Pratt algorithm to efficiently find all occurrences of a pattern in a long text.
音声機能が動作しない場合はこちらをご確認ください
Related words
Knuth-Morris-Pratt algorithm
Proper noun
(computing
theory)
A
linear-time
algorithm
that
searches
for
occurrences
of
one
text
string
within
another,
employing
the
observation
that
when
a
mismatch
occurs,
the
search
string
itself
embodies
sufficient
information
to
determine
where
the
next
match
could
begin,
thus
reducing
the
number
of
possible
match
locations
that
must
be
checked.
Japanese Meaning
Knuth-Morris-Prattアルゴリズムは、文字列探索において、あるテキスト内から指定されたパターン文字列の出現箇所を効率的に検索する線形時間アルゴリズムです。 / このアルゴリズムは、不一致が生じた場合にパターン文字列自体の情報を利用して次の比較位置を決定することで、検査する候補箇所の数を削減し、効率的な文字列探索を実現します。
Related Words
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
