Given an array nums containing $n$ unsorted distinct numbers in the range $0,n,$ return the only number in the range that is missing from the array.

Example input$/$output:

$0,1,2$ return $3,$

$1,0,3,4$ returns $2$

Criteria:

$\backslash$table$[[$Test #$,$Input,Output$],[1,0,1,2,3],[2,1,0,3,4,2],[3,7,0,1,2,3,4,5,7,8,6],[4,\backslash$table$[[,],[10,11$