Leetcode 275. H-Index II

最新推荐文章于 2025-05-04 15:02:14 发布

小白菜又菜

最新推荐文章于 2025-05-04 15:02:14 发布

阅读量223

点赞数

文章标签： leetcode 算法解题报告

本文链接：https://blog.csdn.net/mobius_strip/article/details/132955204

版权

本文介绍了一种使用二分搜索算法在对论文引用次数排序的数组中快速找到研究人员的h指数的方法。h指数定义为满足至少被引用次数达到其值的论文数量的最大值。算法在对数时间内运行，适用于IT技术中的信息检索和量化研究影响力问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

Given an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper and citations is sorted in ascending order, return the researcher’s h-index.

According to the definition of h-index on Wikipedia: The h-index is defined as the maximum value of h such that the given researcher has published at least h papers that have each been cited at least h times.

You must write an algorithm that runs in logarithmic time.

Algorithm

Bineary search.

Code

class Solution:
    def hIndex(self, citations: List[int]) -> int:
        K = len(citations)
        if 1 == K:
            return (citations[0] >= 1) * 1
        
        L, R, = 0, len(citations) - 1
        while L < R:
            Mid = (L + R) // 2
            if citations[Mid] >= K - Mid:
                R = Mid
            else: L = Mid + 1

        while L <= R and citations[L] < K - L:
            L += 1
        return K - L