leetcode刷题笔记 268.丢失的数字【简单】

int missingNumber(vector<int>& nums) {
	int sum = 0;
	int len = nums.size();
	int total = len * (len - 1) / 2;
	for (int i = 0; i < len; i++) {
		sum += nums[i];
	}
	return total - sum;
}