文件: root - text - article - 2020 - 01 - longest-consecutive-sequence.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 26127 次搜索 | 69 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 26127 次搜索 | 69 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Amazon:
You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.
For example, the input array [100, 4, 200, 1, 3, 2] has the longest consecutive sequence 1, 2, 3, 4, and thus, you should return its length, 4.
Can you do this in linear time?
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 26127 次搜索 | 69 个单词 You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.
For example, the input array [100, 4, 200, 1, 3, 2] has the longest consecutive sequence 1, 2, 3, 4, and thus, you should return its length, 4.
def longest_consecutive(nums):
# Fill this in.
print longest_consecutive([100, 4, 200, 1, 3, 2])
# 4
Can you do this in linear time?
猜您喜欢...
- [Daily Problem] Course Prerequisites
- Print a tree level-by-level, with line-breaks
- Kaprekar
- Daily Interview Problem: First Missing Positive Integer
- Spreadsheet Columns
- Find the non-duplicate number
- Algorithm Interview: No Adjacent Repeating Characters
- Compare Version Numbers
- Floor and Ceiling of a Binary Search Tree
- Most Frequent Subtree Sum
©2006~2024 牛排过熟 - 0.00728 秒 - 7437.621 KB/s - 38 在线 内存: 515.75 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。