[LeetCode] H-Index II

275. H-Index II

Given an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper and citations is sorted in an ascending order, return compute the researcher’s h-index.

According to the definition of h-index on Wikipedia: A scientist has an index h if h of their n papers have at least h citations each, and the other n − h papers have no more than h citations each.

If there are several possible values for h, the maximum one is taken as the h-index.

1
2
3
4
5
6
7
8
9
10
class Solution {
public:
int hIndex(vector<int>& citations) {
int h = 0, sz = citations.size(), res;
while(end(citations) - lower_bound(begin(citations), end(citations), h) >= h) {
res = h++;
}
return res;
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2021/04/21/PS/LeetCode/h-index-ii/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.