您的位置 首页 JAVA(2017)

LeetCode – 594. Longest Harmonious Subsequence

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.

public class Solution {
    public int findLHS(int[] nums) {
        HashMap<Integer,Integer> map = new HashMap();
        int res =0;
        for(int i=0;i<nums.length;i++){
            if(!map.containsKey(nums[i])){
                map.put(nums[i],1);
            }
            else{
                map.put(nums[i],map.get(nums[i])+1);
            }
            int tmp = nums[i]+1;
            int tmpp = nums[i] -1;
            if(map.containsKey(tmp)){
                if(map.get(nums[i]) + map.get(tmp)>res){
                    res = map.get(nums[i]) + map.get(tmp);
                }
            }
            if(map.containsKey(tmpp)){
                if(map.get(nums[i]) + map.get(tmpp)>res){
                    res = map.get(nums[i]) + map.get(tmpp);
                }                
            }
        }
        
        return res;
        
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 594. Longest Harmonious Subsequence》

发表评论

电子邮件地址不会被公开。

返回顶部