Description

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.

Examples

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.

Input:nums = [0,1]
Output:2
Explanation:

n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number.

Input:nums = [9,6,4,2,3,5,7,0,1]
Output:8
Explanation:

n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number.

Constraints

  • n == nums.length
  • 1 ≤ n ≤ 10⁴
  • 0 ≤ nums[i] ≤ n
  • All numbers in nums are unique.

Ready to solve this problem?

Practice solo or challenge other developers in a real-time coding battle!