Find All Duplicates in an Array LeetCode solution in C++

1
class Solution {
2
public:
3
vector<int> findDuplicates(vector<int> &nums) {
4
int n = nums.size();
5
vector<int> a;
6
vector<int> arr(n + 1, 0);
7
for (int i = 0; i < nums.size(); i++) arr[nums[i]]++;
8

9
for (int j = 0; j <= n; j++)
10
if (arr[j] == 2) a.push_back(j);
11

12
return a;
13
}
14
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0