leetcode594+最长和谐子序列，使用map进行hash统计

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82391348

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

class Solution {
public:
    int findLHS(vector<int>& nums) {
        map<int, int>Mp;
        for(int i=0; i<nums.size(); i++) Mp[nums[i]]+=1;
        int maxLen = 0;
        for(auto i:Mp){
            if(Mp.find(i.first+1)!=Mp.end()){
                maxLen = max(maxLen, Mp[i.first]+Mp[i.first+1]);
            }
        }
        return maxLen;
    }
};