Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0501_0600.s0594_longest_harmonious_subsequence.Solution

```
public class Solution
extends Object
```
594 - Longest Harmonious Subsequence.
Easy

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

Given an integer array nums, return the length of its longest harmonious subsequence among all its possible subsequences.

A subsequence of array is a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements.

Example 1:

Input: nums = [1,3,2,2,5,2,3,7]

Output: 5

Explanation: The longest harmonious subsequence is [3,2,2,2,3].

Example 2:

Input: nums = [1,2,3,4]

Output: 2

Example 3:

Input: nums = [1,1,1,1]

Output: 0

Constraints:
- 1 <= nums.length <= 2 * 10⁴
- -10⁹ <= nums[i] <= 10⁹

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int findLHS(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- findLHS
```
public int findLHS(int[] nums)
```