为longest consecutive sequence增加了一个worst case为O(n)的解法 #12
Conversation
This file contains hidden or 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
soulmachine
added a commit
that referenced
this pull request
Jan 16, 2014
为longest consecutive sequence增加了一个worst case为O(n)的解法
|
Good job, thanks :) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
hi,我看了一下你之前的实现,你的解法在worst case下是O(n^2)的.
比如对于[1,2,3,...,n]这样的sequence:
你要做的查询次数大致是1+2+3+...+n = O(n^2)(边角的查询忽略).
我下面提供的解法原始思路来自于http://discuss.leetcode.com/questions/1070/longest-consecutive-sequence 下的第一个回答.