# 0594. Longest Harmonious Subsequence
###### tags: `Leetcode` `Easy` `HashMap`
Link: https://leetcode.com/problems/longest-harmonious-subsequence/
## Code

class Solution {
    public int findLHS(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        for(int num:nums){
            map.put(num, map.getOrDefault(num, 0)+1);
        }
        int len = 0;
        for(int num:map.keySet()){
            if(map.containsKey(num+1)) len = Math.max(map.get(num+1)+map.get(num), len);
            else if(map.containsKey(num-1)) len = Math.max(map.get(num-1)+map.get(num), len);
        }
        return len;
    }
}