1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
| #include <vector>
#include <unordered_map>
using std::vector;
using std::unordered_map;
class Solution {
public:
vector<int> getSneakyNumbers(vector<int> &nums)
{
unordered_map<int, int> umap;
vector<int> res;
int i, n = nums.size();
for (i = 0; i < n; i++) {
umap[nums[i]]++;
if (umap[nums[i]] == 2) {
res.push_back(nums[i]);
}
if (res.size() == 2) {
break;
}
}
return res;
}
};
|
