mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 03:27:07 +00:00
Time: 0 ms (100%), Space: 16.9 MB (26.86%) - LeetHub
This commit is contained in:
@@ -0,0 +1,13 @@
|
|||||||
|
class Solution:
|
||||||
|
def hIndex(self, citations: List[int]) -> int:
|
||||||
|
citations.sort(reverse=True)
|
||||||
|
|
||||||
|
n = len(citations)
|
||||||
|
maxSoFar = 0
|
||||||
|
for i, x in enumerate(citations):
|
||||||
|
if i + 1 >= x:
|
||||||
|
maxSoFar = max(maxSoFar, x)
|
||||||
|
else:
|
||||||
|
maxSoFar = max(maxSoFar, i + 1)
|
||||||
|
|
||||||
|
return maxSoFar
|
||||||
Reference in New Issue
Block a user