LeetCode每日一题——275. H-Index II

文章目录

一、题目

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.

Example 1:

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, their h-index is 3.

Example 2:

Input: citations = [1,2,100]

Output: 2

Constraints:

n == citations.length

1 <= n <= 105

0 <= citations[i] <= 1000

citations is sorted in ascending order.

二、题解

cpp 复制代码
class Solution {
public:
    int hIndex(vector<int>& citations) {
        int n = citations.size();
        int left = 0, right = n - 1;
        while(left <= right){
            int mid = (left + right) >> 1;
            int ret = n - mid;
            if(citations[mid] >= ret) right = mid - 1;
            else if(citations[mid] < ret) left = mid + 1;
        }
        return n - left;
    }
};
相关推荐
yanchao_hu31 分钟前
数据结构基础内容(第二篇:线性结构)
数据结构·windows
明明如月学长1 小时前
什么你不知道 Cherry Studio 有快捷助手?
算法
拳里剑气1 小时前
C语言:顺序表(上)
c语言·开发语言·数据结构·学习方法
Vegetable_Dragon1 小时前
数论1.01
算法
Star在努力1 小时前
15-C语言:第15天笔记
c语言·笔记·算法
我有一计3332 小时前
【算法笔记】5.LeetCode-Hot100-矩阵专项
人工智能·算法·程序员
行然梦实2 小时前
KnEA(Knee-point-driven Evolutionary Algorithm)简介
人工智能·算法·机器学习
铭哥的编程日记2 小时前
《C++继承详解:从入门到理解公有、私有与保护继承》
c++
qq_513970442 小时前
力扣 hot100 Day58
算法·leetcode
积极向上的zzz2 小时前
java中一些数据结构的转换
java·开发语言·数据结构