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

这一题看题意说的挺麻烦的，不过按照维基百科上的另一种解读就很简单的：

可以按照如下方法确定某人的H指数：

1. 将其发表的所有SCI论文按被引次数从高到低排序；
2. 从前往后查找排序后的列表，直到某篇论文的序号大于该论文被引次数。所得序号减一即为H指数。

于是，我们就按上面的方法，先排序，然后找到序号比引用次数大的位置，返回减一即可。

需要注意的是题目中的最后一句话，当所有的引用次数都比序号大的话，返回最大的序号即可。

代码如下，复杂度O(nlogn)+O(n)=O(nlogn)：

	public int hIndex(int[] citations) {
		if (citations.length == 0) {
			return 0;
		}
		Arrays.sort(citations);
		int h = 0;
		for (int i = citations.length - 1; i >= 0; i--) {
			if (citations.length - i > citations[i]) {
				h = citations.length - i;
				break;
			}
			if (i == 0) {
				h = citations.length + 1;
			}
		}
		return h - 1;
	}