首页 > 代码库 > LeetCode：Longest Consecutive Sequence
LeetCode：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.
这个方法依赖hashSet，空间复杂度O(N)
Solution：
public class Solution { public int longestConsecutive(int[] num) { HashSet<Integer> set = new HashSet<Integer>(); int length = 0; for(int e : num){ set.add(e); } for(int i = 0; i < num.length;i++){ int l = num[i] -1; int r = num[i] +1; int c = 1; while(set.contains(l)){ c++; set.remove(l); l--; } while(set.contains(r)){ c++; set.remove(r); r++; } length = Math.max(length,c); } return length; }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。