Sponsored
Sponsored
Given the array is sorted, we can efficiently search for the h-index using binary search, aiming for logarithmic time complexity. The idea is to use the binary search to find the maximum h such that citations[h] ≥ h.
Time Complexity: O(log n).
Space Complexity: O(1).
1def hIndex(citations):
2 n = len(citations)
3 left, right = 0, n - 1
4 while left <= right:
5 mid = (left + right) // 2
6 if citations[mid] == n - mid:
7 return n - mid
8 elif citations[mid] < n - mid:
9 left = mid + 1
10 else:
11 right = mid - 1
12 return n - left
13
14citations = [0, 1, 3, 5, 6]
15print(hIndex(citations)) # Output: 3The Python method hIndex implements binary search, updating left and right pointers to find the h-index. It exploits Python's integer division and flexible data handling.
In this linear scan approach, we traverse the sorted citations list from beginning to end. The goal is to determine the maximum valid h-index by checking citations against their corresponding paper count.
Time Complexity: O(n).
Space Complexity: O(1).
1using System;
2
public class Solution {
public int HIndex(int[] citations) {
int n = citations.Length;
for (int i = 0; i < n; ++i) {
if (citations[i] >= n - i) {
return n - i;
}
}
return 0;
}
public static void Main() {
Solution sol = new Solution();
int[] citations = {0, 1, 3, 5, 6};
Console.WriteLine(sol.HIndex(citations)); // Output: 3
}
}The C# solution uses a for loop to iterate over the citations array. The approach calculates the h-index by directly verifying each citation against the required values.