[LeetCode] 594. Longest Harmonious Subsequence - Java

• 문제 링크

Longest Harmonious Subsequence - LeetCode

 

• 풀이 코드

import java.util.HashMap;
import java.util.Map;

public class Solution {

    public int findLHS(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i : nums) map.put(i, map.getOrDefault(i, 0) + 1);

        int max = 0;
        for (int i : map.keySet()) if (map.containsKey(i + 1)) max = Math.max(max, map.get(i) + map.get(i + 1));

        return max;
    }

}