Leetcode - Longest Harmonious Subsequence

violet posted @ Apr 17, 2020 05:58:56 AM in 算法 with tags Algorithm Golang hash , 263 阅读

https://leetcode.com/problems/longest-harmonious-subsequence/

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].

func findLHS(nums []int) int {
    hash := map[int]int{}
    for _, n := range nums {
        hash[n]++
    }
    
    max := 0
    for key, val := range hash {
        if hash[key+1] > 0 {
            if hash[key+1] + val > max {
                max = hash[key+1] + val
            }
        }
    }
    
    return max
}