g0101_0200.s0128_longest_consecutive_sequence.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0101_0200.s0128_longest_consecutive_sequence;

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
// #Big_O_Time_O(N_log_N)_Space_O(1) #2022_06_23_Time_18_ms_(91.05%)_Space_64.8_MB_(63.58%)

import java.util.Arrays;

/**
 * 128 - Longest Consecutive Sequence\.
 *
 * Medium
 *
 * Given an unsorted array of integers `nums`, return _the length of the longest consecutive elements sequence._
 *
 * You must write an algorithm that runs in `O(n)` time.
 *
 * **Example 1:**
 *
 * **Input:** nums = [100,4,200,1,3,2]
 *
 * **Output:** 4
 *
 * **Explanation:** The longest consecutive elements sequence is `[1, 2, 3, 4]`. Therefore its length is 4. 
 *
 * **Example 2:**
 *
 * **Input:** nums = [0,3,7,2,5,8,4,6,0,1]
 *
 * **Output:** 9 
 *
 * **Constraints:**
 *
 * *   0 <= nums.length <= 10⁵
 * *   -10⁹ <= nums[i] <= 10⁹
**/
@SuppressWarnings("java:S135")
public class Solution {
    public int longestConsecutive(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        Arrays.sort(nums);
        int max = Integer.MIN_VALUE;
        int thsMax = 1;
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i + 1] == nums[i] + 1) {
                thsMax += 1;
                continue;
            }
            if (nums[i + 1] == nums[i]) {
                continue;
            }
            // Start of a new Sequene
            max = Math.max(max, thsMax);
            thsMax = 1;
        }
        return Math.max(max, thsMax);
    }
}