首页 > 代码库 > 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.
思路
先对数组排序，然后用DP
1 public class Solution { 2 public int longestConsecutive(int[] num) { 3 Arrays.sort(num); 4 int curLength = 1; 5 int maxLength = 1; 6 7 for(int i = 1; i < num.length; i++){ 8 if(num[i] == num[i - 1]) 9 continue;10 else if(num[i] - num[i - 1] == 1){11 curLength ++;12 maxLength = maxLength > curLength ? maxLength : curLength;13 }14 else15 curLength = 1;16 }//for17 18 return maxLength;19 }20 }
Longest Consecutive Sequence
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。