275. H-Index II

275. H-Index II

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?

class Solution { public int hIndex(int[] citations) { int len = citations.length; int left = 0, right = len - 1; while(left <= right) { int mid = left + (right - left) / 2; if(citations[mid] == len - mid) { return len - mid; }else if(citations[mid] < len - mid) { left = mid + 1; }else { right = mid - 1; } } return len - left; }}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。