本文共 496 字，大约阅读时间需要 1 分钟。
This problem is designed specifically to use binary search. In fact, in H-Index, someone has already used this idea (you may refer to :-))
The code is as follows.
1 class Solution { 2 public: 3 int hIndex(vector & 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 };
转载地址：http://opyba.baihongyu.com/