forked from sureshmangs/Code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path274. H-Index.cpp
62 lines (44 loc) · 1.61 KB
/
274. 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
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each."
Example:
Input: citations = [3,0,6,1,5]
Output: 3
Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had
received 3, 0, 6, 1, 5 citations respectively.
Since the researcher has 3 papers with at least 3 citations each and the remaining
two with no more than 3 citations each, her h-index is 3.
Note: If there are several possible values for h, the maximum one is taken as the h-index.
// Brute force
class Solution {
public:
int hIndex(vector<int>& citations) {
int n=citations.size();
int h=1, res=0;
while(h<=n){
int cnt=0;
for(int i=0;i<n;i++){
if(citations[i]>=h) cnt++;
}
if(cnt>=h)
res=h;
h++;
}
return res;
}
};
// Optimized , if array is sorted
class Solution {
public:
int hIndex(vector<int>& citations) {
// citations can be in range of 1 t0 n
int n=citations.size();
int low=0, high=n-1;
while(low<=high){
int mid=low+(high-low)/2;
if(citations[mid]==n-mid) return citations[mid];
else if(citations[mid]>n-mid) high=mid-1;
else low=mid+1;
}
return n - low;
}
};