# 【LeetCode】275. H-Index II 解题报告（Python）

900 篇文章 136 订阅
1033 篇文章 43 订阅

id： fuxuemingzhu

## 题目描述：

Given an array of citations sorted in ascending order (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 = [0,1,3,5,6]
Output: 3
Explanation: [0,1,3,5,6] means the researcher has 5 papers in total and each of them had
received 0, 1, 3, 5, 6 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.

This is a follow up problem to H-Index, where citations is now guaranteed to be sorted in ascending order.
Could you solve it in logarithmic time complexity?

## 解题方法

274. H-Index中，是先排序再遍历做的，这个题已经排好了序，所以比274更简单，使用二分查找可以快速求解。

class Solution(object):
def hIndex(self, citations):
"""
:type citations: List[int]
:rtype: int
"""
N = len(citations)
l, r = 0, N - 1
H = 0
while l <= r:
mid = l + (r - l) / 2
H = max(H, min(citations[mid], N - mid))
if citations[mid] < N - mid:
l = mid + 1
else:
r = mid - 1
return H


## 日期

2018 年 10 月 6 日 —— 努力看书

06-18 54
02-10 1256
02-21 137
03-18 580
09-15 2万+
03-08 305
07-12 24
02-26 105
02-25 184
02-28 260
09-05 852
09-05 3091
12-06 242

### “相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

¥2 ¥4 ¥6 ¥10 ¥20

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