题解 | #数组中的最长连续子序列#

class Solution {
public:
    int MLS(vector<int>& arr) {
        sort(arr.begin(),arr.end());
        int count = 1,max = 1;
        for(int i = 1;i<arr.size();i++)
        {
            if(arr[i] - arr[i-1] == 1)
            {
                count++;
            }
            else if(arr[i] == arr[i-1])
            continue;
            else
             count = 1;
             if(count > max)
             {
                max = count;
             }
        }
        return max;
    }
};