leetcode/src/missingNumber.cpp at master · markhary/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// https://leetcode.com/problems/missing-number/
//
// Status: Accepted
// Runtime: 20 ms
// Score: 98.21 %
//

#include <numeric>
#include <vector>

#include <gtest/gtest.h>
#include "args.h"
#include "macros.h"

using namespace std;

// class definition comes from leetcode
class Solution
{
public:
    int missingNumber(vector<int> &nums)
    {
        int n = nums.size();
        return (n) * (n + 1) / 2 - std::accumulate(nums.begin(), nums.end(), 0);
    }
};

TEST(MissingNumber, Example1)
{
    Solution solution;
    vector<int> numbers = {3, 0, 1};
    int answer = 2;

    ASSERT_EQ(solution.missingNumber(numbers), answer);
}

TEST(MissingNumber, Example2)
{
    Solution solution;
    vector<int> numbers = {0, 1};
    int answer = 2;

    ASSERT_EQ(solution.missingNumber(numbers), answer);
}

TEST(MissingNumber, Example3)
{
    Solution solution;
    vector<int> numbers = {9, 6, 4, 2, 3, 5, 7, 0, 1};
    int answer = 8;

    ASSERT_EQ(solution.missingNumber(numbers), answer);
}

TEST(MissingNumber, Example4)
{
    Solution solution;
    vector<int> numbers = {0};
    int answer = 1;

    ASSERT_EQ(solution.missingNumber(numbers), answer);
}