[LeetCode]594. Longest Harmonious Subsequence

[LeetCode]594. Longest Harmonious Subsequence

题目描述

思路

哈希表统计每个元素出现的次数

代码

#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int findLHS(vector<int>& nums) {
        unordered_map<int, int> um;
        for (int num : nums)
            ++um[num];
        int res = 0;
        for (auto p : um) {
            if (um.count(p.first - 1))
                res = max(res, p.second + um[p.first - 1]);
            if (um.count(p.first + 1))
                res = max(res, p.second + um[p.first + 1]);
        }
        return res;
    }
};

int main() {
    vector<int> nums = { 1,1,1,1 };
    Solution s;
    cout << s.findLHS(nums) << endl;

    system("pause");
    return 0;
}