class Solution
{
public:
int missingNumber(vector<int>& nums)
{
unordered_set<int> us;
int n = nums.size();
for (int i = 0; i < n; i++)
{
us.insert(nums[i]);
}
int missing = -1;
for (int i = 0; i <= n; i++)
{
if (us.count(i) == 0)
{
missing = i;
break;
}
}
return missing;
}
};
int missingNumber(int* nums, int numsSize)
{
int i = 0;
int sum = (1 + numsSize) * numsSize / 2;
for (i = 0; i < numsSize; i++)
{
sum -= nums[i];
}
return sum;
}