Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit de94528

Browse files
Fix typo.
1 parent 27b5550 commit de94528

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

‎leetcode/hard/128_longest_consecutive_sequence.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -13,6 +13,7 @@ However, the run-time would be poor, O(N^2), you would need a visited set to avo
1313

1414
You can further improve the space complexity by only starting at either the left-most number or the right-most number.
1515
That would mean you just traverse only in one direction, avoiding the need of a visited set.
16+
This solution requires two passes.
1617

1718
```
1819
class Solution:

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /