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

459.重复的子字符串移动匹配的空间复杂度 #2843

Open

shwpatrick opened this issue Nov 25, 2024 · 0 comments

shwpatrick commented Nov 25, 2024

由于移动匹配中有使用
string t = s + s;
是否空间复杂度应该为O(n) 较为适合?

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