题目链接:https://www.acwing.com/problem/content/description/64/
题目如下:
class Solution {
public:
int getMissingNumber(vector<int>& nums) {
//用等比数列求和公式,先求出总和,在用O(n)的时间复杂度,减去每个元素
int n=nums.size();
int sum=n*(n+1)/2;
for(auto e:nums){
sum-=e;
}
return sum;
}
};