You are given an array nums that contains n unique numbers.
Your task is to identify and return the single number that is missing from the range 0 to n (inclusive).
You may assume that:
nums always contains unique numbers.0, 1, ..., n will be absent from the nums array.Return the missing number.
[2, 3, 1]
0
The array [2, 3, 1] is missing 0.
[3, 0, 1]
2
The array [3, 0, 1] is missing 2.
[1, 0, 2, 3]
4
The array [1, 0, 2, 3] is missing 4.