Skip to content

[pull] main from itcharge:main #194

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
May 23, 2025
Merged

[pull] main from itcharge:main #194

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
67eacd6
typo
JoeCqupt May 22, 2025
1d7425b
typo
JoeCqupt May 22, 2025
932f5fb
Merge pull request #214 from JoeCqupt/patch-1
itcharge May 23, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ BF 算法非常简单，容易理解，但其效率很低。主要是因为在

在最理想的情况下（第一次匹配直接匹配成功），BF 算法的最佳时间复杂度是 $O(m)$。

在一般情况下，根据等概率原则，平均搜索次数为 $\frac{(n + m)}{2}$，所以 Brute Force 算法的平均时间复杂度为 $O(n + m)$。
在一般情况下，根据等概率原则，平均搜索次数为 $\frac{(n + m)}{2}$，所以 Brute Force 算法的平均时间复杂度为 $O(n \times m)$。

## 参考资料

Expand Down