[leetcode] problem 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.”

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.

Code

public int (int[] citations) {
    int n = citations.length;
    int[] stats = new int[n + 1]; 
    int sum = 0;

    for (int i = 0; i < n; i++) {
        int idx = citations[i] > n ? n : citations[i];
        stats[idx]++; 
    }

    for (int i = n; i >= 0; i--) {
        sum += stats[i];

        if (sum >= i)
            return i;
    }

    return 0;
}

[leetcode] problem 274 – h-index

Example

Note

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能