Eric 的小站

1
输入：nums = [100,4,200,1,3,2]
2
输出：4
3
解释：最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。

1
输入：nums = [0,3,7,2,5,8,4,6,0,1]
2
输出：9

1
class Solution {
2
public:
3
    int longestConsecutive(vector<int>& nums) {
4
        if (nums.size() == 0)
5
            return 0;
6
        if (nums.size() == 1)
7
            return 1;
8
        sort(nums.begin(), nums.end());
9
        int left = 0, right = 1, Temp = nums[0], maxLen = 1;
10
        for (; right < nums.size(); ++right) {
11
            if (nums[right] == Temp + 1) {
12

13
            } else if (nums[right] == Temp) {
14
                left++;
15
            } else {
16
                maxLen = max(right - left, maxLen);
17
                left = right;
18
            }
19
            Temp = nums[right];
20
        }
21
        maxLen = max(right - left, maxLen);
22
        return maxLen;
23
    }
24
};