本文共 1019 字，大约阅读时间需要 3 分钟。

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.

思路

原数组排序，遍历，当有n篇index>=index，则为H-index=n

喜欢有序的世界～～

python代码

class Solution(object):    def hIndex(self,citations):        citations.sort(reverse=True)        flag=0        for i in range(len(citations)):            if citations[i]>=i+1:                flag=flag+1        return flag

转载地址：http://vwqmi.baihongyu.com/