class Solution {
public:
int missingNumber(vector<int>& nums) {
int n = nums.size();
vector<int> a (n+1,0);
if(n == 1)
{
if (nums[0] == 0)
return 1;
if (nums[0] == 1)
return 0;
}
for(int i = 0; i < n; i++)
{
int s = nums[i];
printf("%d ",s);
a[s] = 1;
}
printf("\n");
for(int i = 0; i < n+1; i++)
{
printf("%d ",a[i]);
if(a[i] == 0)
return i;
}
}
};
LeetCode 268 缺失数字(Missing Number)
最新推荐文章于 2019-06-01 14:07:19 发布