easyBit Manipulation
Missing Number
## Problem
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*.
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
n=3, expected [0,1,2,3], missing 2.
Input
nums = [0,1]
Output
2
n=2, expected [0,1,2], missing 2.
Input
nums = [9,6,4,2,3,5,7,0,1]
Output
8
Missing 8.
Constraints
n == nums.length
1 <= n <= 10^4
0 <= nums[i] <= n
All the numbers of nums are unique.
Python
Loading...