594. Longest Harmonious Subsequence

594. Longest Harmonious Subsequence

• 题目描述：We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.

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

• Example 1:

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

• 给定一个数组，找出数组中的最长子序列，使得子序列中的最大值与最小值的差不超过1。

• 思路：遍历数组统计每个元素出现次数并存储到Map中，遍历map找出最大相邻元素值之和。

• 代码

  package HashTable;
  
  import java.util.HashMap;
  import java.util.Map;
  
  /**
  * @author OovEver
  * 2018/1/9 10:17
  */
  public class LeetCode594 {
    public int findLHS(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int n : nums) {
            map.put(n, map.getOrDefault(n, 0) + 1);
        }
        int result = 0;
        for (int k : map.keySet()) {
            if (map.containsKey(k + 1)) {
                result = Math.max(result, map.get(k) + map.get(k + 1));
            }
        }
        return result;
    }
  }