给定一个未排序的整数数组 nums
,找出数字连续的最长序列(不要求序列元素在原数组中连续)的长度。
进阶:你可以设计并实现时间复杂度为 O(n)
的解决方案吗?
示例 1:
输入:nums = [100,4,200,1,3,2]
输出:4
解释:最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。
示例 2:
输入:nums = [0,3,7,2,5,8,4,6,0,1] 输出:9
提示:
0 <= nums.length <= 104
-109 <= nums[i] <= 109
package Solution128;
import java.util.Arrays;
class Solution {
public int longestConsecutive(int[] nums) {
int maxlen = 1;
if (nums.length < 2) {
return nums.length;
}
Arrays.sort(nums);
int count = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] == nums[i - 1]) {
continue;
}
if (nums[i] == nums[i - 1] + 1) {
count++;
} else {
count = 1;
}
if (count > maxlen) {
maxlen = count;
}
}
return maxlen;
}
public static void main(String[] args) {
Solution sol = new Solution();
int[] nums = { 1, 2, 0, 1 };
System.out.println(sol.longestConsecutive(nums));
}
}