首页 > 代码库 > Longest Consecutive Sequence
Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.
Your algorithm should run in O(n) complexity.
class Solution {public: int longestConsecutive(vector<int> &num) { set<int> s(num.begin(), num.end()); auto it = s.begin(); int c = 1; int l = 1; int prev = *it; for(++it; it!=s.end();it++){ if(*it == prev+1){ c++; } else{ l = max(l, c); c = 1; } prev = *it; } return max(l,c); }};
Longest Consecutive Sequence
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。