# 448. Find All Numbers Disappeared in an Array

## Easy

***

Given an array `nums` of `n` integers where `nums[i]` is in the range `[1, n]`, return _an array of all the integers in the range_ `[1, n]` _that do not appear in_ `nums`.

&#x20;

**Example 1:**

<pre><code>Input: nums = [4,3,2,7,8,2,3,1]
<strong>Output:
</strong> [5,6]
</code></pre>

**Example 2:**

<pre><code>Input: nums = [1,1]
<strong>Output:
</strong> [2]
</code></pre>

&#x20;

**Constraints:**

* `n == nums.length`
* `1 <= n <= 105`
* `1 <= nums[i] <= n`

&#x20;

**Follow up:** Could you do it without extra space and in `O(n)` runtime? You may assume the returned list does not count as extra space.
