leetcode

0 class Solution {

1 public:

2 vector<int> occurrencesOfElement(vector<int> &nums, vector<int> &queries, int x) {

3 static int count[100001];

4 int sz = 1;

5

6 for (int i = 0; i < size(nums); i++) {

7 if (nums[i] != x) continue;

8 count[sz++] = i;

9 }

10

11 for (auto &query : queries) {

12 query = query < sz ? count[query] : -1;

13 }

14

15 return queries;

16 }

17 };