leetcode-go/easy/594.longest-harmonious-subsequence.go

func findLHS(nums []int) int {
	freq := make(map[int]int)
	for _, i := range nums {
		freq[i]++
	}
	l := 0
	for k, v := range freq {
		if val, ok := freq[k+1]; ok {
			l = maxInt(l, val+v)
		}
	}
	return l
}

func maxInt(x, y int) int {
	if x < y {
		return y
	}
	return x
}