https://leetcode-cn.com/problems/h-index-ii/
思路:即找到
a
r
r
[
i
]
>
=
n
−
i
arr[i]>=n-i
arr[i]>=n−i的第一个
i
i
i,所以是求满足题意的最小值,那么在不满足条件时再修改下限
l
l
l即可。
class Solution:
def hIndex(self, citations: List[int]) -> int:
n=len(citations)
l,r=0,n-1
while l<=r:
mid=(l+r)//2
if citations[mid]>=n-mid:
r=mid-1
else:
l=mid+1
return n-l