Missing Number
Easy
Array
Hash Table
Math
Bit Manipulation
Sorting
Given an array `nums` containing `n` distinct numbers in the range `[0, n]`, return *the only number in the range that is missing from the array*.
Example 1
Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number.
Example 2
Input: nums = [0,1]
Output: 2

Constraints

  • •n == nums.length
  • •1 <= n <= 10⁴
  • •0 <= nums[i] <= n
  • •All the numbers of nums are unique.
Time Complexity
O(n)
Space Complexity
O(1)
14
Case 1
Input: [3,0,1]
Expected: 2
Case 2
Input: [0,1]
Expected: 2
Case 3
Input: [9,6,4,2,3,5,7,0,1]
Expected: 8