1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
| class Solution { public int longestConsecutive(int[] nums) { if(nums == null || nums.length == 0) { return 0; }
Set<Integer> set = new HashSet<>(); for(int num : nums) { set.add(num); }
int maxLen = 0; for(int num : set) { int length = 0; while(set.contains(num)) { length ++; num ++; maxLen = Math.max(maxLen, length); } } return maxLen; } }
|