## 题目描述：

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]

code

public class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> list = new ArrayList<Integer>();
if(nums == null || nums.length == 0)
return list;
int n = nums.length;
int [] returnedArray = new int[n];
int i = 0;
for(i = 0;i<n;i++){
returnedArray[nums[i]-1]++;
}
for(i = 0;i<n;i++){
if(returnedArray[i] == 0){
list.add(i+1);
}
}
return list;
}
}

#### leetcode之Find All Numbers Disappeared in an Array

2016-12-24 18:21:10

#### LeetCode448 Find All Numbers Disappeared in an Array(java/python)

2016-11-30 15:07:17

#### 【LeetCode-448】 Find All Numbers Disappeared in an Array(C++)

2016-12-20 09:47:13

#### 448. Find All Numbers Disappeared in an Array

2016-11-01 14:31:44

#### [LeetCode]Find All Numbers Disappeared in an Array(Java)

2016-12-20 21:19:02

#### 448. Find All Numbers Disappeared in an Array(java)

2017-08-23 23:15:21

#### leetcode448 Find All Numbers Disappeared In An Array Java

2017-02-25 16:17:15

#### leetcode_448. Find All Numbers Disappeared in an Array 找出不在数组中的数，正负号标记法

2016-12-20 22:24:26

#### LeetCode 448.Find All Number Disappeared in an Array

2016-12-05 09:37:39

#### LeetCode 448. Find All Numbers Disappeared in an Array(Java)

2017-01-23 22:38:15

## 不良信息举报

Find All Numbers Disappeared in an Array