[LeetCode] Longest Harmonious Subsequence 最长和谐子序列
排序后建立存储每个数字出现次数的hashmap 记录出现次数,再次遍历数组 如果两数字之差小于等于1 那么从map中取出这两个数字出现的次数+1 记录下来这个结果并和后面的结果比较
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。由于这里只是让我们求长度,并不需要返回具体的子序列。所以我们可以对数组进行排序,那么实际上我们只要找出来相差为1的两个数的总共出现个数就是一个和谐子序列的长度了。明白了这一点,我们就可以建立一个数字和其出现次数之间的映射,利用map的自动排序的特性,那么我们遍历map的时候就是从小往大开始遍历,我们从第二个映射对开始遍历,每次跟其前面的映射对比较,如果二者的数字刚好差1,那么就把二个数字的出现的次数相加并更新结果res即可,参见代码如下:
class Solution {
public int findLHS(int[] nums) {
int n = nums.length;
int sum = 0;
Arrays.sort(nums);
HashMap<Integer,Integer> hm = new HashMap<>();
for(int num : nums){
if(hm.containsKey(num))
hm.put(num, hm.get(num) + 1);
else
hm.put(num, 1);
}
for(int i=1; i<n; i++){
if(nums[i] - nums[i-1] == 1)
sum = Math.max(sum,hm.get(nums[i]) + hm.get(nums[i-1]));
}
return sum;
}
}
暴力解法:
class Solution {
public int findLHS(int[] nums) {
Arrays.sort(nums);
int n = nums.length;
int sum = 0;
for(int i=0; i<n; i++){
int compare = 0;
for(int j = i + 1; j<n; j++){
if(nums[j] - nums[i] == 0)
continue;
if(nums[j] - nums[i] == 1)
compare = j - i + 1;
}
sum = Math.max(sum, compare);
}
return sum;
}
}