[leetcode] 274. H-Index

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.

1. An easy approach is to sort the array first.
2. What are the possible values of h-index?
3. A faster approach is to use extra space.

解法一：

先sort，然后考虑最大值为0的corner case。从大到小遍历citation，如果大于res，则res加1。

class Solution {
public:
    int hIndex(vector<int>& citations) {
        if(citations.empty()) return 0;
        sort(citations.begin(),citations.end());
        if(citations.back()==0) return 0;
        int res = 0;
        for(int i = citations.size()-1; i>=0; i--){
            if(citations[i]>res) res++;
        }
        return res;
        
    }
};

解法二：

smart的解法。新建一个数组，长度为n+1，从0到n-1位分别表示citation等于i的paper数量，最后以为表示citation大于等于n的paper数量。然后再从打往小求sum，如果sum大于等于i，说明有i篇paper citation等于i，停止循环。

class Solution {
public:
    int hIndex(vector<int>& citations) {
        int n = citations.size(), h = 0;
        int* counts = new int[n+1]();
        for (int c : citations)
            counts[min(c, n)]++;
        for (int i = n; i; i--) {
            h += counts[i];
            if (h >= i) return i;
        }  
        return h;
    }
};