Design HashSet LeetCode solution in C++

1
class MyHashSet {
2
  vector<int> v;
3

4
 public:
5
  MyHashSet() {}
6

7
  void add(int key) {
8
    auto it = find(v.begin(), v.end(), key);
9
    if (it == v.end()) {
10
      v.push_back(key);
11
    }
12
  }
13

14
  void remove(int key) {
15
    auto it = find(v.begin(), v.end(), key);
16
    if (it != v.end()) {
17
      v.erase(it);
18
    }
19
  }
20

21
  bool contains(int key) {
22
    return find(v.begin(), v.end(), key) != v.end();
23
  }
24
};