We define a harmonious array as one 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 subsequences* (not necessarily contiguous). A subsequence is derived by deleting some elements without changing the order of the remaining elements.
nums = [array of integers]
integer (length of longest harmonious subsequence)
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], which has length 5.
Example 2:
Input:
nums = [1,2,3,4]
Output:
2
Explanation:
The longest harmonious subsequence can be [2,3] or [3,4].