package leetcode;

/**
 * https://leetcode.com/problems/h-index-ii/
 */
public class Problem275 {
    public int hIndex(int[] citations) {
        // TODO:
        return 0;
    }

    public static void main(String[] args) {
        Problem275 prob = new Problem275();
    }
}

@@ -144,16 +144,318 @@
     
-// TODO:
+int idx = binarySearch(citations, 0, citations.length-1);%0A        return citations.length - idx;%0A    %7D%0A%0A    private int binarySearch(int%5B%5D citations, int lo, int hi) %7B%0A        if (lo %3E hi) %7B%0A            return lo;%0A        %7D%0A        int mid = (lo + hi) / 2;%0A        if (citations%5Bmid%5D == citations.length-mid) %7B
 %0A   
@@ -463,16 +463,201 @@
     
+    
 return 
-0
+mid;%0A        %7D%0A        if (citations%5Bmid%5D %3E citations.length-mid) %7B%0A            return binarySearch(citations, lo, mid-1);%0A        %7D%0A        return binarySearch(citations, mid+1, hi)
 ;%0A  

Solve problem 275