标签：maximum sub span btn diff oss where nbsp color
We define a harmonious array is 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.
1 public class Solution { 2 public int findLHS(int[] nums) { 3 HashMap<Integer, Integer> numCount = new HashMap<Integer, Integer>(); 4 for (int num : nums) { 5 numCount.put(num, numCount.getOrDefault(num, 0) + 1); 6 } 7 8 int maxLen = 0; 9 Set<Integer> keys = numCount.keySet(); 10 for (int key : keys) { 11 if (numCount.containsKey(key + 1)) { 12 maxLen = Math.max(maxLen, numCount.get(key + 1) + numCount.get(key)); 13 } 14 } 15 16 return maxLen; 17 } 18 }
Longest Harmonious Subsequence
标签：maximum sub span btn diff oss where nbsp color
原文地址：http://www.cnblogs.com/amazingzoe/p/6918000.html
