LeetCode-594. Longest Harmonious Subsequence (JAVA)最长和谐子序列

594. Longest Harmonious Subsequence

We define a harmonious array is an array where the difference between its maximum value and its minimum value isexactly 1.

Now, given an integer array, you need to find the length of its longest harmonious subsequence among all its possiblesubsequences.

Example 1:

Input: [1,3,2,2,5,2,3,7]
Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3].

Note:The length of the input array will not exceed 20,000.

使用map,记录数组中数字出现的次数，连续两个数字出现次数的和即为harmonious subsequence。

不需要考虑同时num-1，num+1

public int findLHS(int[] nums) {
	Map<Integer, Integer> map = new HashMap<>();
	for (int num : nums) {
		// getOrDefault（JDK 8）
		map.put(num, map.getOrDefault(num, 0) + 1);
	}
	int max = 0;
	for (int num : map.keySet()) {
		// 如果map包括num+1，那么比较当前值
		if (map.containsKey(num + 1)) {
			int tmp = map.get(num) + map.get(num + 1);
			max = Math.max(max, tmp);
		}
	}
	return max;

}