LeetCode 274. H-Index 二分

231 篇文章 0 订阅
120 篇文章 1 订阅

Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.

According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each."

Example:

Input: citations = [3,0,6,1,5]
Output: 3 
Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had received 3, 0, 6, 1, 5 citations respectively. Since the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, her h-index is 3.

Note: If there are several possible values for h, the maximum one is taken as the h-index.

--------------------------------

class Solution:
    def hIndex(self, citations: List[int]) -> int:
        citations.sort()
        size = len(citations)

        # idx [0,size-1]
        def f(idx):
            nonlocal citations, size
            return citations[idx] - (size - idx)

        l, r, tgt = 0, size - 1, 0
        while (l <= r):
            mid = l + ((r - l) >> 1)
            fm = f(mid)
            if (tgt > fm):
                l = mid + 1
            else:
                r = mid - 1
        return size-l

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值