1
class Solution {
2
unordered_map<int, vector<int>> itemIndicies;
3

4
public:
5
Solution(vector<int> &nums) {
6
srand(time(NULL));
7

8
for (int i = 0; i < nums.size(); i++) {
9
if (itemIndicies.find(nums[i]) == itemIndicies.end())
10
itemIndicies[nums[i]] = {i};
11
else
12
itemIndicies[nums[i]].push_back(i);
13
}
14
}
15

16
int pick(int target) {
17
int size = itemIndicies[target].size();
18
int randomValue = rand() % size;
19
return itemIndicies[target][randomValue];
20
}
21
};
22

23
/**
24
* Your Solution object will be instantiated and called as such:
25
* Solution* obj = new Solution(nums);
26
* int param_1 = obj->pick(target);
27
*/

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0