[leetcode] 268. Missing Number

Question:

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?

Solution:

看了好久才发现这是一道数学题，题目要求用O(n)的时间，O(1)的空间跑出来，才发觉是一道数学题，直接求和减去数组的和就知道哪一个数字miss了。
时间复杂度O(n)
空间复杂度O(1)

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