点击打开链接
class Solution {
public:
int hIndex(vector<int>& citations) {
int len = citations.size(), result =0, left=0, right = len-1,mid=0;
while (left<=right) {
mid = (left+right)/2;
if(citations[mid] == len-mid) return len-mid;
else if(citations[mid] > len-mid) right=mid-1;
else left = mid+1;
}
return len-left;
}
};