Leetcode Problem 275. H-Index II

275. H-Index II

Leetcode Solutions

Binary Search Approach for Calculating H-Index

  1. Initialize left to 0 and right to n - 1, where n is the length of the citations array.
  2. While left is less than or equal to right, perform the following steps: a. Calculate mid as the midpoint between left and right. b. If citations[mid] is equal to n - mid, return n - mid as the h-index. c. If citations[mid] is less than n - mid, search the right half by setting left to mid + 1. d. If citations[mid] is greater than n - mid, search the left half by setting right to mid - 1.
  3. If the loop ends without returning, the h-index is n - left.
UML Thumbnail

Linear Search Approach for Calculating H-Index

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...