#128. 最长连续序列
因为需要O(n)复杂度，所以每一个去暴力是不可以的。但是只有hashset不减枝也过不去。
所以需要剪枝，只对number-1不在hashset里的数字进行操作这样就能删掉很多，从而近似O(n)
Leetcode388
摘要部分
388. 文件的最长绝对路径
Hello World
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
Quick Start
Create a new post
1 | $ hexo new "My New Post" |
More info: Writing
Run server
1 | $ hexo server |
More info: Server
Generate static files
1 | $ hexo generate |
More info: Generating
Deploy to remote sites
1 | $ hexo deploy |
More info: Deployment