LeetCode 448. Find All Numbers Disappeared in an Array
Posted A-Little-Nut
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 448. Find All Numbers Disappeared in an Array相关的知识,希望对你有一定的参考价值。
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) {
vector<int> help(nums.size()+1,0),res;
for(int i=0;i<nums.size();i++)
help[nums[i]]=1;
for(int i=1;i<=nums.size();i++)
if(help[i]==0)
res.push_back(i);
return res;
}
};
以上是关于LeetCode 448. Find All Numbers Disappeared in an Array的主要内容,如果未能解决你的问题,请参考以下文章
#Leetcode# 448. Find All Numbers Disappeared in an Array
LeetCode 448. Find All Numbers Disappeared in an Array
LeetCode 448. Find All Numbers Disappeared in an Array
LeetCode - 448. Find All Numbers Disappeared in an Array