Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Solve it without using extra space and with O(n) time complexity.