class Solution:
def hIndex(self, citations):
if len(citations)==1:
if citations[0]==1:
return 1
if citations[0]==0:
return 0
citations.sort(reverse=-1)
h=0
for i in range(len(citations)):
if citations[i]<i+1:
h=i
break
if citations[-1]>=len(citations):
return len(citations)
return h
leetcode---274.H指数
最新推荐文章于 2024-05-31 17:17:25 发布