Saturday, January 2, 2016

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.
Java Code:
Posted by at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)