Given an array containing
n distinct numbers taken from
0, 1, 2, ..., n
, find the one that is missing from the array.
Example 1
Input: [3,0,1] Output: 2
Example 2
Input: [9,6,4,2,3,5,7,0,1] Output: 8
class Solution { public: int missingNumber(vector<int>& nums) { sort(nums.begin(),nums.end()); if(nums[0]!=0) return 0; for(int i=0;i<nums.size();i++) { if(nums[i+1]-nums[i]==1) continue; else return nums[i]+1; } } };