leetcode 594. Longest Harmonious Subsequence 最长和谐子序列 + Map遍历统计

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.

本题题意很简单，就是寻找和谐子序列的长度，直接使用map标记，然后遍历即可

代码如下：

#include <iostream>#include <vector>#include <map>#include <set>#include <queue>#include <stack>#include <string>#include <climits>#include <algorithm>#include <sstream>#include <functional>#include <bitset>#include <numeric>#include <cmath>using namespace std;class Solution {public:    int findLHS(vector<int>& nums)     {        map<int, int> mmp;        for (int i : nums)            mmp[i]++;        int maxLen = 0;        for (auto i : mmp)        {            if (mmp.find(i.first + 1) != mmp.end())                maxLen = max(maxLen, mmp[i.first] + mmp[i.first + 1]);        }        return maxLen;    }};