Question
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?
Hint:
Expected runtime complexity is in O(log n) and the input is sorted.
Code
public class Solution {
public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) return 0;
int n = citations.length;
for (int i = 0; i < n; i++) {
if (citations[i] >= n - i) return n - i;
}
return 0;
}
}
Solution
与274的解法1一样。
