https://leetcode-cn.com/problems/missing-number/
思路:二分查找
int missingNumber(vector<int>& nums) {
int left = 0, right = nums.size();
while(left < right) {
int mid = (left + right) / 2;
int count = 0;
for (int i = 0;i < nums.size(); i++) {
if (nums[i] <= mid) {
count += 1;
}
}
if (count == mid + 1) {
left = mid + 1;
} else {
right = mid;
}
}
return left;
}