题目：
题解：
class Solution:
def hIndex(self, citations: List[int]) -> int:
n = len(citations)
left = 0; right = n - 1
while left <= right:
mid = left + (right - left) // 2
if citations[mid] >= n - mid:
right = mid - 1
else:
left = mid + 1
return n - left
![[C++进阶]继承](https://i-blog.csdnimg.cn/direct/76d319057c694f7ba1cb55549b76804b.png)
