LeetCode 274. H-Index（桶排序）

274. H-Index

Medium

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.

题意

给定一个长度为N的引用数组，求h-index: 某人总共N篇论文中，有h篇引用量至少为h，其余(N-h)篇引用量至多为h

思路

桶排序。由于h-index值必须属于[0, N]的区间，因此只要有N+1个桶分别对应引用量为0~N的文章的数量。

代码

class Solution {
    public int hIndex(int[] citations) {
        int n = citations.length;
        if (n == 0) {
            return 0;
        }
        int[] buckets = new int[n+1];
        for (int cit: citations) {
            if (cit >= n) {
                ++buckets[n];
            } else {
                ++buckets[cit];
            }
        }
        int cnt = 0;
        for (int i=n; i>=0; --i) {
            cnt += buckets[i];
            if (cnt >= i) {
                return i;
            }
        }
        return 0;
    }
}