Skip to content

Commit 0c5a9aa

Browse files
Create README - LeetHub
1 parent 820b35e commit 0c5a9aa

File tree

1 file changed

+22
-0
lines changed
  • 448-find-all-numbers-disappeared-in-an-array

1 file changed

+22
-0
lines changed
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
<h2><a href="https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/">448. Find All Numbers Disappeared in an Array</a></h2><h3>Easy</h3><hr><div><p>Given an array <code>nums</code> of <code>n</code> integers where <code>nums[i]</code> is in the range <code>[1, n]</code>, return <em>an array of all the integers in the range</em> <code>[1, n]</code> <em>that do not appear in</em> <code>nums</code>.</p>
2+
3+
<p>&nbsp;</p>
4+
<p><strong>Example 1:</strong></p>
5+
<pre><strong>Input:</strong> nums = [4,3,2,7,8,2,3,1]
6+
<strong>Output:</strong> [5,6]
7+
</pre><p><strong>Example 2:</strong></p>
8+
<pre><strong>Input:</strong> nums = [1,1]
9+
<strong>Output:</strong> [2]
10+
</pre>
11+
<p>&nbsp;</p>
12+
<p><strong>Constraints:</strong></p>
13+
14+
<ul>
15+
<li><code>n == nums.length</code></li>
16+
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
17+
<li><code>1 &lt;= nums[i] &lt;= n</code></li>
18+
</ul>
19+
20+
<p>&nbsp;</p>
21+
<p><strong>Follow up:</strong> Could you do it without extra space and in <code>O(n)</code> runtime? You may assume the returned list does not count as extra space.</p>
22+
</div>

0 commit comments

Comments
 (0)