int cmp(const void *e1,const void *e2)
{
    return *(int*)e1-*(int*)e2;
}

int findLHS(int* nums, int numsSize){
    qsort(nums,numsSize,sizeof(int),cmp);
    int begin = 0;
    int res = 0;
    for (int end = 0; end < numsSize; end++) 
    {
        while (nums[end] - nums[begin] > 1) 
        {
            begin++;
        }
        if (nums[end] - nums[begin] == 1) 
        {
            res = fmax(res, end - begin + 1);
        }
    }
        return res;

}