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

the KMP implementation of strstr is not O(n) for worst case #18

Open

WilsonFWL opened this issue Nov 4, 2014 · 1 comment

WilsonFWL commented Nov 4, 2014

For strStr1 in "https://github.com/haoel/leetcode/blob/master/src/strStr/strStr.cpp", below case will get a complexity of O(m*n)
strStr1("aaaaaaaaaaaaaaaaaa","aaaaaab");

JKair commented Feb 2, 2015

I think must sunday

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