Skip to content
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.

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

作者有没有介绍算法中O(n^2)到O(max(m, n))的文章呢? #10

Open
oychao opened this issue Oct 16, 2018 · 2 comments
Open

作者有没有介绍算法中O(n^2)到O(max(m, n))的文章呢? #10

oychao opened this issue Oct 16, 2018 · 2 comments

Comments

@oychao
Copy link

oychao commented Oct 16, 2018

作者在 livoras/blog#13 (comment) 中有提到过这个,不过我单看源码有点吃力,想看看有没有讲这个文章,英文也行

@oychao
Copy link
Author

oychao commented Oct 16, 2018

React官网https://reactjs.org/docs/reconciliation.html 中并没有讲这个,连最短编辑距离都没提到

@Shwvi
Copy link

Shwvi commented Feb 28, 2021

作者应该是把O(M*N)改进成O(N)了,算法参考Levenshtein

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants