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

Jump to bottom

我在看你的gitbook，提个意见 #1

Closed

Insofan opened this issue May 1, 2017 · 1 comment

Labels

Insofan commented May 1, 2017

005最长回文子字符串,应该用Manacher Algorithm（马拉车算法），能从O(n^2)提高到O(n)。我也不太会算法在慢慢做题而已，只是自己在慢慢研究，谢谢你的书。
相关资料
http://www.jianshu.com/p/799bc53d4e3d
https://www.youtube.com/watch?v=V-sEwsca1ak&t=185s

gavinfish added the enhancement label

gavinfish added a commit that referenced this issue


          Enhancement for #1

dfc02bc

Owner

gavinfish commented May 4, 2017

谢谢，已添加。

gavinfish closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment