Leetcode 268. Missing Number (Medium) (cpp)
Tag: Array, Math, Bit Manipulation
Difficulty: Medium
/*
268. Missing Number (Medium)
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3] return 2.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
*/
class Solution {
public:
int missingNumber(vector<int>& nums) {
int _sum = nums.size() * (nums.size() + 1) / 2;
for (int i : nums) {
_sum -= i;
}
return _sum;
}
};