This repository has been archived by the owner on Sep 20, 2023. It is now read-only.
update problem 0004 with required time complexity #62
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
337 不能使用 prein2Tree 方法建立二叉树
add the failed test case
add solution code and the ref: https://leetcode.com/problems/repeated-string-match/discuss/108084/C%2B%2B-4-lines-O\(m-\*-n\)-or-O\(1\)-and-KMP-O\(m-%2B-n\)-or-O\(n\)
Merge pull request wufenggirl#1 from aQuaYi/master
Fix issue 59: Failed passing 686. Repeated String Match
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The problem of "4. Median of two sorted arrays" is requiring O(log(m+n)). Therefore, merging two arrays is not the best solution as the time complexity is O(m+n).
Ironically, due to the big constant, the logarithmic solution is slower than the linear one in leetcode's testdata.