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.

Constraints:

• $n =$ nums.length
• $1 \leq n \leq 10^3$