[LeetCode] H-Index II

最新推荐文章于 2025-09-12 16:49:27 发布

转载最新推荐文章于 2025-09-12 16:49:27 发布 · 56 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/jcliBlogger/p/4782471.html

文章标签：

#开发工具

本文详细介绍了如何运用二分搜索算法解决H-Index问题，通过具体实例展示了算法实现过程，提供了代码示例。

This problem is designed specifically to use binary search. In fact, in H-Index, someone has already used this idea (you may refer to this post :-))

The code is as follows.

 1 class Solution {
 2 public:
 3     int hIndex(vector<int>& citations) {
 4         int n = citations.size(), l = 0, r = n - 1;
 5         while (l <= r) {
 6             int m = l + (r - l) / 2;
 7             if (citations[m] >= n - m) r = m - 1;
 8             else l = m + 1;
 9         }
10         return n - r - 1;
11     }
12 };