标签：class tor dex desc ble pre ret 怎样 www.
这是 H指数 进阶问题：如果citations 是升序的会怎样？你可以优化你的算法吗？
详见：https://leetcode.com/problems/h-index-ii/description/
class Solution {
public:
int hIndex(vector<int>& citations) {
int n=citations.size();
int left=0;
int right=n-1;
while(left<=right)
{
int mid=(left+right)/2;
if(citations[mid]==n-mid)
{
return n-mid;
}
else if(citations[mid]>n-mid)
{
right=mid-1;
}
else
{
left=mid+1;
}
}
return n-left;
}
};
参考：https://www.cnblogs.com/grandyang/p/4782695.html
标签：class tor dex desc ble pre ret 怎样 www.
原文地址：https://www.cnblogs.com/xidian2014/p/8761470.html
