Adding Accepted Solution - Problem - 18 - H - index II

Author: Vanditg

Leetcode-June-Challenge/Problem - 18/AcceptedSolution.py

@@ -0,0 +1,32 @@
+##==================================
+## Leetcode June Challenge 
+## Username: Vanditg
+## Year: 2020
+## Problem: 18
+## Problem Name: H-Index II 
+##===================================
+#Given an array of citations sorted in ascending order (each citation is a non-negative integer) 
+#of a researcher, write a function to compute the researcher's h-index.
+#
+#According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers 
+#have at least h citations each, and the other N − h papers have no more than h citations each."
+#
+#Example:
+#
+#Input: citations = [0,1,3,5,6]
+#Output: 3 
+#Explanation: [0,1,3,5,6] means the researcher has 5 papers in total and each of them had 
+#             received 0, 1, 3, 5, 6 citations respectively. 
+#             Since the researcher has 3 papers with at least 3 citations each and the remaining 
+#             two with no more than 3 citations each, her h-index is 3.
+class Solution:
+    def hIndex(self, citations):
+        n = len(citations)
+        left, right = 0, n - 1
+        while left <= right:
+            mid = int((left + right) / 2)
+            if citations[mid] >= n - mid:
+                right = mid - 1
+            else:
+                left = mid + 1
+        return n - left