Longest Harmonious Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  int findLHS(vector<int> &nums) {
4
    map<int, int> m;
5
    for (int i = 0; i < nums.size(); i++) {
6
      m[nums[i]]++;
7
    }
8
    int ans = 0;
9
    int x = -1, y = 0;
10
    for (auto i = m.begin(); i != m.end(); i++) {
11
      if (i->first - x == 1) {
12
        ans = max(ans, y + i->second);
13
      }
14
      x = i->first;
15
      y = i->second;
16
    }
17
    return ans;
18
  }
19
};
20
// if you like the solution plz upvote.