isLouisHsu / isLouisHsu/isLouisHsu.github.io

【算法】KMP | LOUIS' BLOG

Open
#65 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

9cc77d390229d247cff7a38d68a6a6f0 Gitalk
Dominant language
HTML
Stars
4
Forks
1
PR merge metrics
No merged PRs in 30d

Description

https://louishsu.xyz/2020/04/22/%E3%80%90%E7%AE%97%E6%B3%95%E3%80%91KMP/

前言字符串匹配问题是指,给定source字符串和一个target字符串,你应该在source字符串中找出target字符串出现的第一个位置(从$0$开始)。如果不存在,则返回$-1$,例如输入:source = "abcaabaabcaabcacabaa",target = "abcacab"输出;$11$ 暴力匹配暴力匹配是指依次对source中的子字符串

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

The issue links to a KMP string-matching article but does not identify a file, requested change, or acceptance criteria. Read the linked article and repository context first, then clarify what documentation change is wanted and how completion should be verified.

Written by the indexing model from the issue text.

Assessment

Domain
documentation
Issue type
Documentation
Difficulty
1/5
Estimated time
Under an hour
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
15/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.