题目:
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≤a[i]≤n(n =数组大小),一些元素出现两次,其他元素出现一次。查找[1,n]包含的所有不显示在此数组中的元素。
思路:
新设置一个数组b,其元素全为0(其他值也可以),b[nums[i] - 1] += nums[i],这样除了不存在的元素值是0,其他元素都有所增加,遍历数组b,输出元素值为0的地址+1,就是要的答案。
解答:
//总是写错,我能怎么办,我也很绝望啊。。