mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Deven
13 lines
364 B
Python
13 lines
364 B
Python
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 |