LeetCode Solutions/Binary Search Study Plan/Binary Search II/H-Index II.java
class Solution {
    public int hIndex(int[] citations) {
        for (int i=0; i<citations.length; i++){
            if (citations[i] >= citations.length - i){
                return citations.length - i;
            }
        }
        return 0;
    }
}