题目来源【Leetcode】
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input:
[4,3,2,7,8,2,3,1]Output:
[5,6]
这道题比较简单,用一个布尔数组来判断就好,代码如下:
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
int s = nums.size();
bool exit[s+1] = {false};
for(int i = 0; i < s; i ++){
exit[nums[i]] = true;
}
vector<int>disapp;
for(int i = 1; i <= s; i++){
if(exit[i] == false)
disapp.push_back(i);
}
return disapp;
}
};