Added h-index

Author: gahogg

H-Index - Leetcode 274/H-Index - Leetcode 274.cpp

@@ -0,0 +1,24 @@
+#include <vector>
+#include <algorithm>
+
+class Solution {
+public:
+    int hIndex(std::vector<int>& citations) {
+        int n = citations.size();
+        std::vector<int> paperCounts(n + 1, 0);
+
+        for (int c : citations) {
+            paperCounts[std::min(n, c)]++;
+        }
+
+        int h = n;
+        int papers = paperCounts[n];
+
+        while (papers < h) {
+            h--;
+            papers += paperCounts[h];
+        }
+
+        return h;
+    }
+};

H-Index - Leetcode 274/H-Index - Leetcode 274.java

@@ -0,0 +1,20 @@
+public class Solution {
+    public int hIndex(int[] citations) {
+        int n = citations.length;
+        int[] paperCounts = new int[n + 1];
+
+        for (int c : citations) {
+            paperCounts[Math.min(n, c)]++;
+        }
+
+        int h = n;
+        int papers = paperCounts[n];
+
+        while (papers < h) {
+            h--;
+            papers += paperCounts[h];
+        }
+
+        return h;
+    }
+}

H-Index - Leetcode 274/H-Index - Leetcode 274.js

@@ -0,0 +1,18 @@
+var hIndex = function(citations) {
+    var n = citations.length;
+    var paperCounts = new Array(n + 1).fill(0);
+
+    for (var c of citations) {
+        paperCounts[Math.min(n, c)]++;
+    }
+
+    var h = n;
+    var papers = paperCounts[n];
+
+    while (papers < h) {
+        h--;
+        papers += paperCounts[h];
+    }
+
+    return h;
+};

H-Index - Leetcode 274/H-Index - Leetcode 274.py

@@ -0,0 +1,17 @@
+class Solution:
+    def hIndex(self, citations: List[int]) -> int:
+        n = len(citations)
+        paper_counts = [0] * (n+1)
+
+        for c in citations:
+            paper_counts[min(n, c)] += 1
+        
+        h = n
+        papers = paper_counts[n]
+        
+        while papers < h:
+            h -= 1
+            papers += paper_counts[h]
+        
+        return h
+        # Time: O(n), Space: O(n)