leetcode/algorithms/unique_occurrences.cpp at master · hanfezh/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
 * =====================================================================================
 *
 *       Filename:  unique_occurrences.cpp
 *
 *    Description:  1207. Unique Number of Occurrences
 *                  https://leetcode.com/problems/unique-number-of-occurrences/
 *
 *        Version:  1.0
 *        Created:  06/09/2024 09:57:25
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:  xianfeng.zhu@gmail.com
 *   Organization:
 *
 * =====================================================================================
 */

#include <map>
#include <set>
#include <utility>
#include <vector>

#include "gmock/gmock.h"
#include "gtest/gtest.h"

using std::map;
using std::pair;
using std::set;
using std::vector;

class Solution {
 public:
  bool uniqueOccurrences(vector<int>& arr) {
    map<int, int> counts;
    for (const int val : arr) {
      counts[val]++;
    }
    set<int> occ;
    for (const auto& entry : counts) {
      auto ret = occ.insert(entry.second);
      if (!ret.second) {
        return false;
      }
    }
    return true;
  }
};

TEST(Solution, uniqueOccurrences) {
  vector<pair<vector<int>, bool>> cases = {
      std::make_pair(vector<int>{1, 2}, false),
      std::make_pair(vector<int>{1, 2, 2, 1, 1, 3}, true),
      std::make_pair(vector<int>{-3, 0, 1, -3, 1, 1, 1, -3, 10, 0}, true),
  };
  for (auto& c : cases) {
    EXPECT_EQ(Solution().uniqueOccurrences(c.first), c.second);
  }
}