JAVA_Longest Harmonious Subsequence

JAVA_Longest Harmonious Subsequence_LeetCode 594 풀이 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; } } * 출처 Longest Harmonious Subsequence - LeetCode Longest Harmonious Subsequence - We define a harmonious array as an array where the difference between its maximum value and it...

#JAVA #JAVA_LeetCode594 #JAVA_LongestHarmoniousSubsequence #JAVA_LongestHarmoniousSubsequence_LeetCode594 #LongestHarmoniousSubsequence_LeetCode594

원문링크 : JAVA_Longest Harmonious Subsequence_LeetCode 594