LeetCode：274. H-Index

0X01 题目

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.

Hint:

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

0X02 题意

以[3, 0, 6, 1, 5]为例，大于等于3的数有三个，因此这道题要求出的数是3。

自己再举一个例子[3, 0, 6, 1, 5, 4, 5, 5 ,9]，其中，大于等于3的数有7个，大于等于4的数有6个，大于等于5的数有5个。因此取3、4、5之中最大的值5.返回结果就是5了。

按照上面的理解，这道题是怎么也解不出来了，看答案都看不懂。因此说明还是没有理解清楚题目。

下面再看一下Wikipedia关于h-index的解释：

“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.”

意思是，一个科学家的N篇文章中，如果有h篇文章被引用了h次以上，其余的N-h篇文章每篇都被引用了少于h次，那么返回h。

因此，我们要求的不是[3, 0, 6, 1, 5]中的数字3，也不是数字3的下标，而是大于等于3的元素个数，即5-2=3。

换一个例子就能明白了，[0, 1, 5, 5, 6, 7]，以此数组为输入，输出是4。

0X03 题解

1.先排序（Lily：Java）

一种方式就是先排序，然后根据排序后的数组来找出h-index的值。

以[3, 0, 6, 1, 5]为例，排序后的数组是[0, 1, 3, 5, 6]，然后从0开始遍历，判断citations[i] >= length-i，当该条件成立时就说明我们找到了一篇文章，它的引用数满足我们的要求，这时候返回length-i即可，length-i表示大于该引用数的文章有几篇，即h-index。

public class Solution {
    public int hIndex(int[] citations) {
        int length = citations.length;
        if(citations == null || length == 0)
            return 0;
        Arrays.sort(citations);
        for (int i = 0; i < length; i++){
            if(citations[i] >= length-i)
                return length-i;
        }
        return 0;   
    }
}

---

2016-08-03 13:37:59 hzct