[LeetCode 275] H-Index II

本文主要是介绍[LeetCode 275] H-Index II，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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

Hint:

1. Expected runtime complexity is in O(log n) and the input is sorted.

solution:

Binary search.

public int hIndex(int[] citations) {if(citations.length <=0) return 0;int len = citations.length;int start = 0;int end = len-1;while(start<=end) {int mid = start + (end-start)/2;if(citations[mid] == len-mid) return len-mid;else if (citations[mid] < len-mid) start = mid+1;else end = mid-1;}return len-start;}

这篇关于[LeetCode 275] H-Index II的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---