用哈希表
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
Set<Integer> seen = new HashSet<Integer>();
int i = 0;
while(i < nums.length)
{
seen.add(nums[i]);
i++;
}
List<Integer> re = new ArrayList<Integer>();
int j = 1;
while(j<nums.length + 1)
{
if(seen.add(j))
{
re.add(j);
}
j++;
}
return re;
}
}