-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path442. Find All Duplicates in an Array.cpp
66 lines (45 loc) · 1.09 KB
/
442. Find All Duplicates in an Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
int n = nums.size();
int i = 0;
while(i<n) {
while(nums[i]!=i+1) {
if(nums[i] == nums[nums[i]-1])
break;
swap(nums[i], nums[nums[i]-1]);
}
++i;
}
vector<int> result;
for(int i = 0;i<n;++i) {
if(nums[i]!=i+1) {
result.push_back(nums[i]);
}
}
return result;
}
};
------------
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
vector<int> ans;
for(int i = 0; i<nums.size(); ) {
if(nums[i] == i+1) {
i++;
continue;
}
if(nums[nums[i]-1] == nums[i]) {
i++;
continue;
}
swap(nums[nums[i]-1] , nums[i]);
}
for(int i = 0;i<nums.size(); i++) {
if(nums[i]!= i+1)
ans.push_back(nums[i]);
}
return ans;
}
};