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

Open

Open

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

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

Metadata

Assignees

No one assigned

Labels

No labels

No labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests