题目
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]
题意
给你一个数组,1<=数组值<=n,求出1~n中缺少的值。
题解
使用映射。
python代码
class Solution(object):
def findDisappearedNumbers(self, nums):
res = []
m = {}
for i in range(1, len(nums)+1):
m[i] = 0
for i in range(0, len(nums)):
m[nums[i]] = m[nums[i]] + 1
for i in range(1, len(nums)+1):
if m[i] == 0:
res.append(i)
return res
C++代码
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
vector<int>res;
map<int,int>m;
for(int i=0; i<nums.size(); i++)
{
m[nums[i]]++;
}
for(int i=1; i<=nums.size(); i++)
{
if(m[i]==0){
res.push_back(i);
}
}
return res;
}
};