class Solution {
public:
int findLHS(vector<int>& nums) {
map<int,int> m;
int ans=0;
for(auto c : nums)
{
m[c]++;
}
for(auto c : m)
{
if(m.count(c.first+1))//count...............
{
ans=max(ans,c.second+m[c.first+1]);
}
}
return ans;
}
};