-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
37 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,37 @@ | ||
| <h2><a href="https://leetcode.com/problems/missing-number/">268. Missing Number</a></h2><h3>Easy</h3><hr><div><p>Given an array <code>nums</code> containing <code>n</code> distinct numbers in the range <code>[0, n]</code>, return <em>the only number in the range that is missing from the array.</em></p> | ||
|
|
||
| <p> </p> | ||
| <p><strong class="example">Example 1:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> nums = [3,0,1] | ||
| <strong>Output:</strong> 2 | ||
| <strong>Explanation:</strong> n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums. | ||
| </pre> | ||
|
|
||
| <p><strong class="example">Example 2:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> nums = [0,1] | ||
| <strong>Output:</strong> 2 | ||
| <strong>Explanation:</strong> n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums. | ||
| </pre> | ||
|
|
||
| <p><strong class="example">Example 3:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> nums = [9,6,4,2,3,5,7,0,1] | ||
| <strong>Output:</strong> 8 | ||
| <strong>Explanation:</strong> n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums. | ||
| </pre> | ||
|
|
||
| <p> </p> | ||
| <p><strong>Constraints:</strong></p> | ||
|
|
||
| <ul> | ||
| <li><code>n == nums.length</code></li> | ||
| <li><code>1 <= n <= 10<sup>4</sup></code></li> | ||
| <li><code>0 <= nums[i] <= n</code></li> | ||
| <li>All the numbers of <code>nums</code> are <strong>unique</strong>.</li> | ||
| </ul> | ||
|
|
||
| <p> </p> | ||
| <p><strong>Follow up:</strong> Could you implement a solution using only <code>O(1)</code> extra space complexity and <code>O(n)</code> runtime complexity?</p> | ||
| </div> |