遍历数组并用一个数组统计各引用次数的文章篇数,最后从后向前遍历统计数组,返回找到的第一个篇数大于等于引用数的即可。
class Solution:
def hIndex(self, citations: List[int]) -> int:
m, t = max(citations), 0
lis = [0] * (m+1)
for i in citations:
lis[i] += 1
for i in range(m, -1, -1):
t += lis[i]
if i <= t:
return i