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
08-04
190
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-17
149
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-14
210
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-14
332
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交