-
-
Notifications
You must be signed in to change notification settings - Fork 5.7k
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
763 PartitionLabels 时间复杂度 #236
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
您好,昨天做到了这道题,然后和您这边的解法做了一个对比,都是lastIndex的逻辑。readme中写了复杂度是
O(n^2)
,但解法1的start更新为end+1,我觉得时间复杂度是O(n)
的。The text was updated successfully, but these errors were encountered: