-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path274.cpp
88 lines (76 loc) · 1.88 KB
/
274.cpp
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <algorithm>
#include <gtest/gtest.h>
#include <vector>
using namespace std;
class Solution {
public:
int hIndex(vector<int> &citations)
{
sort(citations.begin(), citations.end());
for (int i = 0; i < citations.size(); i++) {
if (citations[i] >= citations.size() - i) {
return citations.size() - i;
}
}
return 0;
}
};
class Testing : public testing::Test {
public:
Solution s;
void SetUp() {}
void TearDown() {}
};
TEST_F(Testing, Case1)
{
vector<int> citations = {3, 0, 6, 1, 5};
EXPECT_EQ(s.hIndex(citations), 3);
}
TEST_F(Testing, Case2)
{
vector<int> citations = {1, 3, 1};
EXPECT_EQ(s.hIndex(citations), 1);
}
TEST_F(Testing, Case3)
{
vector<int> citations = {1, 1, 1};
EXPECT_EQ(s.hIndex(citations), 1);
}
TEST_F(Testing, Case4)
{
vector<int> citations = {1};
EXPECT_EQ(s.hIndex(citations), 1);
}
TEST_F(Testing, Case5)
{
vector<int> citations = {1, 1, 1, 1};
EXPECT_EQ(s.hIndex(citations), 1);
}
TEST_F(Testing, Case6)
{
vector<int> citations = {7, 7, 7, 7};
EXPECT_EQ(s.hIndex(citations), 4);
}
TEST_F(Testing, Case7)
{
vector<int> citations = {9, 9, 8, 8, 7, 7, 6, 6, 5};
EXPECT_EQ(s.hIndex(citations), 6);
}
TEST_F(Testing, Case8)
{
vector<int> citations = {0, 0, 0, 0, 0, 9, 9, 9, 7, 7, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 9, 9, 9,
7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
EXPECT_EQ(s.hIndex(citations), 7);
}
TEST_F(Testing, Case9)
{
vector<int> citations = {0, 0, 1, 1, 1, 3, 3, 3, 3, 3, 3, 7, 7, 7, 8, 8,
4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6};
EXPECT_EQ(s.hIndex(citations), 6);
}
TEST_F(Testing, Case10)
{
vector<int> citations = {1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 3, 5, 5, 2, 5};
EXPECT_EQ(s.hIndex(citations), 4);
}