[leetcode] 274 275 H-Index I && II

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."

For example, given citations = [3, 0, 6, 1, 5], which 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, his h-index is 3.

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

H-Index就是我们常说的影响因子。所谓影响因子是对人而言的，即一个人的论文被引用次数大于n的文章有n篇，最大的n即为该作者的影响因子。

最简单的简单的方法自然是对citations进行排序，然后按顺序遍历即可，时间复杂度为O(nLogn)；

这么简单的话就没有什么意义了，所以题目中说希望给一种利用空间换时间的做法，要求时间复杂度为O(n)；

我们用一个大小为n+ 1的数组v，储存出现该次数的论文的数量，如v[0]就代表着引用次数为0的论文数量，当论文引用次数大于n时，对于作者的影响因子而言，与引用次数为n是没有区别的，顾都存为v[n]，如此空间换时间

class Solution {
public:
    int hIndex(vector<int>& citations) {
        int n= citations.size();
        if(n<= 0) return 0;
        vector<int> v(n+ 1);
        //某一论文引用次数大于总文章数，则记作n即可
        for(int i= 0; i< n; i++){
            if(citations[i]>= n) v[n]++;
             else v[citations[i]]++;
        }
        int ans= 0;
        for(int i= 0; i< n+ 1; i++){
            if(n>= i) ans= i;
            n-= v[i];
        }
        return ans;
        
    }
};

Follow up  for  H-Index : What if the  citations  array is sorted in ascending order? Could you optimize your algorithm?

对于给定升序或降序的优化一般都是从二分查找入手的，代码如下

class Solution {
public:
    int hIndex(vector<int>& citations) {
        if(citations.size()== 0) return 0;
        
        int low= 0, len= citations.size(), high= len- 1, ans= 0;
        while(low<= high){
            int mid= (low+ high)/ 2;
            if(citations[mid]== len- mid) return citations[mid];
             else if(citations[mid]< len- mid){
                 low= mid+ 1;
             }
             else{
                 high= mid- 1;
             }
        }
        
        return len-low;
        
    }
};