Longest Harmonious Subsequence · LeetCode Site Generator

Description

We define a harmounious array as 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].

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

Solution(javascript)

/*
 * @lc app=leetcode id=594 lang=javascript
 *
 * [594] Longest Harmonious Subsequence
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
const findLHS = function (nums) {
  const map = nums.reduce((acc, num) => {
    acc[num] = (acc[num] || 0) + 1
    return acc
  }, {})
  return Object.keys(map).reduce((max, key) => {
    const nextKey = parseInt(key, 10) + 1
    if (map[nextKey] >= 0) {
      return Math.max(
        max,
        map[key] + map[nextKey],
      )
    }
    return max
  }, 0)
}
// @lc code=end