Find All Numbers Disappeared In An Array Problem
Description
LeetCode Problem 448.
Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
Example 1:
1
2
Input: nums = [4,3,2,7,8,2,3,1]
Output: [5,6]
Example 2:
1
2
Input: nums = [1,1]
Output: [2]
Constraints:
- n == nums.length
- 1 <= n <= 10^5
- 1 <= nums[i] <= n
Sample C++ Code
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
vector<int> ans;
for (int i = 0; i < nums.size(); i ++) {
int nxt = nums[i] - 1;
while (nums[nxt] != nxt + 1) {
int nxt_nxt = nums[nxt] - 1;
nums[nxt] = nxt + 1;
nxt = nxt_nxt;
}
}
for (int i = 0; i < nums.size(); i ++) {
if (nums[i] != i + 1)
ans.push_back(i + 1);
}
return ans;
}
};