-
Notifications
You must be signed in to change notification settings - Fork 8
/
leetcode274_h_index.cpp
63 lines (52 loc) · 1.28 KB
/
leetcode274_h_index.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
/**
* @file leetcode274_h_index.cpp
* @author wangguibao(https://github.com/wangguibao)
* @date 2023/06/11 10:38
* @brief https://leetcode.com/problems/h-index
*
**/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int hIndex(vector<int>& citations) {
std::sort(citations.begin(), citations.end());
int len = citations.size();
int citation = -1;
int paper = 0;
for (int i = len - 1; i >= 0; --i) {
citation = citations[i];
++paper;
if (citation < paper) {
paper--;
break;
}
}
return paper;
}
};
int main() {
int n;
std::vector<int> nums;
while (1) {
n = 0;
std::cout << "Number of elements: ";
std::cin >> n;
if (n <= 0) {
return 0;
}
std::cout << n << " integers: " << std::endl;
nums.clear();
int ele;
for (int i = 0; i < n; ++i) {
std::cin >> ele;
nums.push_back(ele);
}
Solution solution;
auto ret = solution.hIndex(nums);
std::cout << ret << std::endl;
}
return 0;
}