地址:https://leetcode.com/problems/missing-number/#/description
暴力低效率:
class Solution {
public:
int missingNumber(vector<int>& nums) {
int i;
map<int,int>s;
for(i=0;i<nums.size();i++){
s[nums[i]]=1;
}
for(i=0;i<=nums.size();i++){
if(s[i]!=1)
break;
}
return i;
}
};
class Solution {
public:
int missingNumber(vector<int>& nums) {
int sum=0,n=nums.size();
for(int i=0;i<n;i++){
sum+=nums[i];
}
return n*(n+1)/2-sum;
}
};